Michael Svendsen

Change-Sensitive Algorithms for Maintaining Maximal Cliques in a Dynamic Graph.

2016 · arXiv (Cornell University)

We consider the maintenance of the set of all maximal cliques in a dynamic graph that is changing through the addition or deletion of edges. We present nearly tight bounds on the magnitude of change …