P367: Enumeration of all maximal independent sets in a circular-arc graph

P367: Enumeration of all maximal independent sets in a circular-arc graph

Input:

A circular-arc graph $G = (V, E)$.

Output:

All maximal independent sets in $G$.

Complexity:

$O(|V|^2 + \beta)$ total time.

Comment:

$\beta$ is the sum of the vertices in all maximal independent sets of $G$.

Reference:

[Leung1984] (Bibtex)