P282: Enumeration of all independent sets in a chordal graph

P282: Enumeration of all independent sets in a chordal graph

Input:

A chordal graph $G = (V, E)$.

Output:

All independent sets in $G$.

Complexity:

Constant time per solution on average after $O(|V| + |E|)$ time for preprocessing.

Comment:

Reference:

[Okamoto2005a] (Bibtex)