P34: Enumeration of all maximal cliques in a graph

P34: Enumeration of all maximal cliques in a graph

Input:

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

Output:

All maximal clique.

Complexity:

$O(\delta\cdot H^3)$ time delay and $O(n+m)$ space.

Comment:

$H$ satisfies $|\{v\in V | \sigma(v)\ge H\}| \le H$.

Reference:

[Chang2013] (Bibtex)