P40: Enumeration of all maximal $\alpha$-acyclic subhypergraphs in a hypergraph
P40: Enumeration of all maximal $\alpha$-acyclic subhypergraphs in a hypergraph
Input:
A hypergraph $H = (V, \mathcal{E})$.
Output:
All maximal $\alpha$-acyclic subhypergraphs in $H$.
Complexity:
$O(|\mathcal{E}|^2(|V|+|\mathcal{E}|))$ delay and $O(|\mathcal{E}|)$space.
Comment:
The name of their algorithm is $\mathtt{GenMAS}$. This algorithm uses the algorithm $\mathtt{FindMAS}$ that outputs a maximal $\alpha$-acyclic subhypergraph.