Finding All Maximal Cliques in Dynamic Graphs

@article{Stix2004FindingAM,
  title={Finding All Maximal Cliques in Dynamic Graphs},
  author={Volker Stix},
  journal={Computational Optimization and Applications},
  year={2004},
  volume={27},
  pages={173-186}
}
  • Volker Stix
  • Published 2004
  • Mathematics, Computer Science
  • Computational Optimization and Applications
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 Gt = (V,Et), where Et − 1 ⊂ Et, t = 1,...,T; E0 = φ. In this article algorithms are provided to track all maximal cliques in a fully dynamic graph. 
Honour Thy Neighbour: Clique Maintenance in Dynamic Graphs
Distributed Maximal Clique Computation and Management
Mining Maximal Cliques on Dynamic Graphs Efficiently by Local Strategies
Efficient Maximal Clique Enumeration Over Graph Data
Change-Sensitive Algorithms for Maintaining Maximal Cliques in a Dynamic Graph
Parallelizing maximal clique and k-plex enumeration over graph data
RDBMS as an Efficient Tool to Mine Cliques on Complex Networks
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 24 REFERENCES
Algorithm 457: finding all cliques of an undirected graph
Fully Dynamic Algorithms for 2-Edge Connectivity
On cliques in graphs
Clustering for faster network simplex pivots
Clique-detection algorithms for matching three-dimensional molecular structures.
Maintaining Minimum Spanning Trees in Dynamic Graphs
Algorithmic graph theory and perfect graphs
The maximum clique problem
Maxima for Graphs and a New Proof of a Theorem of Turán
...
1
2
3
...