P207: Enumeration of all maximal cliques in a massive network

P207: Enumeration of all maximal cliques in a massive network

Input:

A graph $G$.

Output:

All maximal cliques in $G$.

Complexity:

See the paper.

Comment:

This algorithm works in limited memory.

Reference:

[Cheng2011] (Bibtex)