P260: Enumeration of $K$-largest maximal cliques in a graph

P260: Enumeration of $K$-largest maximal cliques in a graph

Input:

A graph $G$.

Output:

$K$-largest maximal cliques in $G$.

Complexity:

Comment:

Reference:

[Bulo2007] (Bibtex)