P180: Enumeration of all maximal cliques in a dynamic graph

P180: Enumeration of all maximal cliques in a dynamic graph

Input:

A graph $G_t = (V, E_t)$.

Output:

All maximal cliques in $G_t$.

Complexity:

Comment:

Reference:

[Stix2004] (Bibtex)