, Volume 27, Issue 2, pp 173-186

Finding All Maximal Cliques in Dynamic Graphs

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


Clustering applications dealing with perception based or biased data lead to models with non-disjunct clusters. There, objects to be clustered are allowed to belong to several clusters at the same time which results in a fuzzy clustering. It can be shown that this is equivalent to searching all maximal cliques in dynamic graphs like G t = (V,E t), where E t − 1E t, t = 1,...,T; E 0 = φ. In this article algorithms are provided to track all maximal cliques in a fully dynamic graph.