P302: Enumeration of all minimal transversal of a hypergraph

P302: Enumeration of all minimal transversal of a hypergraph

Input:

A hypergraph $\mathcal{H}$.

Output:

All minimal transversal of $\mathcal{H}$.

Complexity:

$(n + N)^{O(\log n)}$ total time with $O(n \log n)$ words.

Comment:

$n = \sum_{X \in \mathcal{H}}|X|$ and $N$ is the number of solutions.

Reference:

[Tamaki2000] (Bibtex)