P184: Enumeration of all cliques in a connected graph

P184: Enumeration of all cliques in a connected graph

Input:

A connected graph $G = (V, E)$ and an order $l \ge 2$ of cliques.

Output:

All cliques in $G$.

Complexity:

$O(l\alpha(G)^{l-2}|E|)$ total time and linear space.

Comment:

$\alpha(G)$ is the minimum number of edge-disjoint spanning forests into which $G$ can be decomposed.

Reference:

[Chiba1985] (Bibtex)