P190: Enumeration of all maximal cliques in a graph

P190: Enumeration of all maximal cliques in a graph

Input:

A graph $G$.

Output:

All maximal cliques in $G$.

Complexity:

Comment:

Reference:

[Henry2013] (Bibtex)