Generating all maximal independent sets of bounded-degree hypergraphs

  title={Generating all maximal independent sets of bounded-degree hypergraphs},
  author={Nina Mishra and L. Pitt},
  booktitle={COLT '97},
We show that any monotone function with a read-k CNF representation can be learned in terms of its DNF representation with membership queries alone in time polynomial in the DNF size and n (the number of variables) assuming k is some fixed constant. The problem is motivated by the well-studied open problem of enumerating all maximal independent sets of a given hypergraph. Our algorithm gives a solution for the bounded degree case and works even if the hypergraph is not input, but rather only… Expand
A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
New Results on Monotone Dualization and Generating Hypergraph Transversals
On the complexity of monotone dualization and generating minimal hypergraph transversals
All maximal independent sets and dynamic dominance for sparse graphs
Achieving new upper bounds for the hypergraph duality problem through logic
On Frequent Sets of Boolean
On Berge Multiplication for Monotone Boolean Dualization
Computational aspects of monotone dualization: A brief survey