P201: Enumeration of all maximal cliques in a graph with limited memory

P201: Enumeration of all maximal cliques in a graph with limited memory

Input:

A graph $G$.

Output:

All maximal graphs in $G$.

Complexity:

See the paper.

Comment:

Reference:

[Cheng2012b] (Bibtex)