P229: Enumeration of all $c$-isolated maximal clique in a graph

P229: Enumeration of all $c$-isolated maximal clique in a graph

Input:

A graph $G = (V, E)$ and a positive real number $c$.

Output:

All $c$-isolated maximal clique in $G$.

Complexity:

$O(c^42^{2c}|E|)$ total time.

Comment:

Reference:

[Ito2009] (Bibtex)