P233: Enumeration of all max-$c$-isolated maximal cliques in a graph

P233: Enumeration of all max-$c$-isolated maximal cliques in a graph

Input:

A graph $G = (V, E)$ and an integer $c$.

Output:

All max-$c$-isolated maximal cliques in $G$.

Complexity:

$O(2^cc^5|E|)$ total time.

Comment:

A vertex set $S \subseteq V$ with $k$ vertices is max-$c$-isolated if every vertex in $S$ has less than $c$ neighbors in $V \setminus S$.

Reference:

[Huffner2009] (Bibtex)