P386: Enumeration of all maximal cliques in a given graph

P386: Enumeration of all maximal cliques in a given graph

Input:

A graph $G$.

Output:

All maximal cliques in $G$.

Complexity:

Comment:

Reference:

[Gerhards1979] (Bibtex)