Graph Clustering Using Distance-k Cliques

Software Demonstration
  • Jubin Edachery
  • Arunabha Sen
  • Franz J. Brandenburg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1731)

Abstract

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.

References

  1. [1]
    F. J. Brandenburg, “Graph Clustering: Circles of Cliques,” Proceedings of Graph Drawing Symposium, GD’97 Rome, September 1997. Lecture Notes in Computer Science, Berlin: Springer-Verlag, 1353, pp. 158–168, 1998.CrossRefGoogle Scholar
  2. [2]
    J. S. Deogun, D. Kratsch and G. Steiner, “An approximation algorithm for clustering graphs with dominating diametral paths,” Information Processing Letters, 61, pp. 121–127, 1997.CrossRefMathSciNetGoogle Scholar
  3. [3]
    P. Eades, “Multilevel Visualization of Clustered Graphs,” Proceedings of Graph Drawing’96, Berkeley, California, September,1996.Google Scholar
  4. [4]
    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
  5. [5]
    D. W. Matula and L.L. Beck, “Smallest-last ordering and clustering and graph coloring algorithms,” Journal of the Association of Computing Machinery 30 pp. 417–427, 1983.MATHMathSciNetGoogle Scholar
  6. [6]
    T. Roxborough and A. Sen, “Graph clustering using multiway ratio cut,” Proceedings of Graph Drawing Symposium, GD’97 Rome, September 1997. Lecture Notes in Computer Science, Berlin: Springer-Verlag, 1353, pp. 291–296, 1998.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Jubin Edachery
    • 1
  • Arunabha Sen
    • 1
  • Franz J. Brandenburg
    • 2
  1. 1.Department of Computer ScienceArizona State UniversityTempeUSA
  2. 2.Lehrstuhl für Informatik Universität PassauPassauGermany

Personalised recommendations