P368: Enumeration of all maximal independent sets in a chordal graph

P368: Enumeration of all maximal independent sets in a chordal graph

Input:

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

Output:

All maximal independent sets in $G$.

Complexity:

$O((|V| + |E|)N)$ total time.

Comment:

$N$ is the number of solutions.

Reference:

[Leung1984] (Bibtex)