P438: Enumeration of all cliques in a given graph

P438: Enumeration of all cliques in a given graph

Input:

A graph $G = (V, E)$.

Output:

All cliques in $G$.

Complexity:

unbounded

Comment:

Reference:

[Harary1957] (Bibtex)