hypergraph separator
From: dwdw <wudan_at_uregina.ca>
Date: 19 Feb 2002 20:41:53 -0800
Message-ID: <b7ca1adc.0202192041.623a2b4c_at_posting.google.com>
Hello,
I am looking for an algorithm for the folowing problem. Given H=[h_1,h_2,...,h_n} as a hypergraph I want to identify all the separators s of H such that s is a subset of h_i, 1<=i<=n.
Date: 19 Feb 2002 20:41:53 -0800
Message-ID: <b7ca1adc.0202192041.623a2b4c_at_posting.google.com>
Hello,
I am looking for an algorithm for the folowing problem. Given H=[h_1,h_2,...,h_n} as a hypergraph I want to identify all the separators s of H such that s is a subset of h_i, 1<=i<=n.
Is anyone here aware of this kind of algorithm?
THanks,
Dan
Received on Wed Feb 20 2002 - 05:41:53 CET