Graph Clustering Using Distance-k Cliques
Identifying the natural clusters of nodes in a graph and treating them as supernodes or metanodes for a higher level graph (or an abstract graph) is a technique used for the reduction of visual complexity of graphs with a large number of nodes. In this paper we report on the implementation of a clustering algorithm based on the idea of distance-k cliques, a generalization of the idea of the cliques in graphs. The performance of the clustering algorithm on some large graphs obtained from the archives of Bell Laboratories is presented.
- P. Eades, “Multilevel Visualization of Clustered Graphs,” Proceedings of Graph Drawing’96, Berkeley, California, September,1996.Google Scholar
- M. R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman Publishers, San Francisco, 1978.Google Scholar