P403: Enumeration of all cliques in an undirected graph

P403: Enumeration of all cliques in an undirected graph

Input:

An undirected graph $G$.

Output:

All cliques in $G$.

Complexity:

Comment:

Reference:

[Johnston1976] (Bibtex)