# Generating all maximal independent sets of bounded-degree hypergraphs

@inproceedings{Mishra1997GeneratingAM, title={Generating all maximal independent sets of bounded-degree hypergraphs}, author={Nina Mishra and L. Pitt}, booktitle={COLT '97}, year={1997} }

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

#### Figures and Topics from this paper

#### 25 Citations

A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph

- Computer Science, Mathematics
- SIAM J. Discret. Math.
- 2007

Exact algorithms for finding minimum transversals in rank-3 hypergraphs

- Mathematics, Computer Science
- J. Algorithms
- 2004

New Results on Monotone Dualization and Generating Hypergraph Transversals

- Mathematics, Computer Science
- SIAM J. Comput.
- 2003

On the complexity of monotone dualization and generating minimal hypergraph transversals

- Computer Science, Mathematics
- Discret. Appl. Math.
- 2008

New results on monotone dualization and generating hypergraph transversals

- Mathematics, Computer Science
- STOC '02
- 2002

All maximal independent sets and dynamic dominance for sparse graphs

- Mathematics, Computer Science
- TALG
- 2009

Achieving new upper bounds for the hypergraph duality problem through logic

- Mathematics, Computer Science
- CSL-LICS
- 2014

Computational aspects of monotone dualization: A brief survey

- Computer Science, Mathematics
- Discret. Appl. Math.
- 2008