P33: Enumeration of all maximal clique in a graph

P33: Enumeration of all maximal clique in a graph

Input:

An undirected graph $G=(V, E)$.

Output:

All maximal clique.

Complexity:

Comment:

Reference:

[Akkoyunlu1973] (Bibtex)