P139: Enumeration of all maximal independent sets in a $c$-conformal hypergraph
P139: Enumeration of all maximal independent sets in a $c$-conformal hypergraph
Input:
A $c$-conformal hypergraph $\mathcal{H} \in A(k, r)$, where $c \le$ constant and $k + r \le c$.
Output:
All maximal independent sets in $\mathcal{H}$.
Complexity:
Incremental polynomial time.
Comment:
$A(k, r)$ is the class of hyperedges with $(k, r)$-bounded intersections, i.e. in which the intersection of any $k$ distinct hyperedges has size at most $r$.