P409: Enumeration of all cliques in a graph

P409: Enumeration of all cliques in a graph

Input:

A graph $G$.

Output:

All cliques in $G$.

Complexity:

Comment:

They pointed out Augustson and Minker's algorithm has two errors.

Reference:

[Mulligan1972] (Bibtex)