P226: Enumeration of all maximal cliques in a graph

P226: Enumeration of all maximal cliques in a graph

Input:

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

Output:

All maximal cliques in $G$ in lexicographical order.

Complexity:

$O(|V||E|)$ delay with exponential space.

Comment:

Reference:

[Gely2009] (Bibtex)