P278: Enumeration of all maximal cliques in a graph

P278: Enumeration of all maximal cliques in a graph

Input:

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

Output:

All maximal cliques in $G$.

Complexity:

$O(3^{n/3})$ total time.

Comment:

Reference:

[Tomita2006] (Bibtex)