P299: Enumeration of all maximal independent set of a hypergraph of bounded dimension

P299: Enumeration of all maximal independent set of a hypergraph of bounded dimension

Input:

A hypergraph $H$ of bounded dimension.

Output:

All maximal independent set of a hypergraph of bounded dimension.

Complexity:

Comment:

The proposed algorithm runs in parallel.

Reference:

[Boros2000a] (Bibtex)