P227: Enumeration of all maximal cliques in a graph

P227: Enumeration of all maximal cliques in a graph

Input:

A graph $G$.

Output:

All maximal cliques in $G$.

Complexity:

Comment:

This algorithm can be paralleled.

Reference:

[Schmidt2009] (Bibtex)