P448: Enumeration of all potential maximal cliques in a given graph

P448: Enumeration of all potential maximal cliques in a given graph

Input:

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

Output:

All potential maximal cliques in $G$.

Complexity:

$O(n^3|\Delta_G|^3 + n^2m|\Delta_G|^2)$ total time.

Comment:

$\Delta_G$ is the set of all potential maximal cliques in $G$.

Reference:

[Bouchitte2002] (Bibtex)