P288: Enumeration of all maximal cliques in a dynamic graph

P288: Enumeration of all maximal cliques in a dynamic graph

Input:

A dynamic graph $G$.

Output:

All maximal cliques in $G$.

Complexity:

Comment:

Reference:

[Stix2004] (Bibtex)