A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf
.
AN EFFICIENT INCREMENTAL ALGORITHM FOR GENERATING ALL MAXIMAL INDEPENDENT SETS IN HYPERGRAPHS OF BOUNDED DIMENSION
2000
Parallel Processing Letters
We show that for hypergraphs of bounded edge size, the problem of extending a given list of maximal independent sets is N C-reducible to the computation of an arbitrary maximal independent set for an induced sub-hypergraph. The latter problem is known to be in RN C. In particular, our reduction yields an incremental RN C dualization algorithm for hypergraphs of bounded edge size, a problem previously known to be solvable in polynomial incremental time. We also give a similar parallel algorithm
doi:10.1142/s0129626400000251
fatcat:yg6gg7zjsvcgxazmwctrr73pk4