P225: Enumeration of all maximal cliques in a comparability graph

P225: Enumeration of all maximal cliques in a comparability graph

Input:

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

Output:

All maximal cliques in $G$ in lexicographical order.

Complexity:

$O(|V|)$ delay and $O(|V| + |E|)$ space.

Comment:

Reference:

[Gely2009] (Bibtex)