P176: Enumeration of all Berge acyclic subhypergraphs in a hypergraph

P176: Enumeration of all Berge acyclic subhypergraphs in a hypergraph

Input:

A hypergraph $\mathcal{H}$.

Output:

All Berge acyclic subhypergraphs in $\mathcal{H}$.

Complexity:

$O(rd\tau(m))$ time per subhypergraph.

Comment:

$r$ and $d$ are the rank and the degree of $\mathcal{H}$ and $\tau(m) = O((\log\log m)^2 / \log \log \log (m))$.

Reference:

[Wasa2013] (Bibtex)