Automatic graph clustering (system demonstration)
We present a new, easy to understand algorithm and programming environment allowing for the interactive or automatic clustering of graphs according to several heuristics.
Our approach is based on graph structure only and can be implemented to run efficiently with a personal computer. It is capable of efficiently clustering graphs with > 3000 vertices. We shall demonstrate the interactive user environment for automatic clustering. As an application, we consider the clustering of large WWW connectivity graphs.
- 1.M. R. Anderberg. Cluster Analysis for applications. Academic Press, 1973.Google Scholar
- 2.Bosak. Graph Partitioning, Kluwer, 1990.Google Scholar
- 3.F. J. Brandenburg. Designing graph drawings by layout graph grammars. In Roberto Tamassia and Ioannis Tollis, editors, Proceedings of Graph Drawing '94, volume 894 of Lecture Notes in Computer Science, pages 416–427. DIMACS Workshop on Graph Drawing, Springer Verlag, 1995.Google Scholar
- 4.P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149–160, 1984.Google Scholar
- 5.J. Hartigan. Clustering Algorithms. J. Wiley and Sons, 1975.Google Scholar
- 6.S. Mukherjea, J. D. Foley, and S. Hudson. Visualizing complex hypermedia networks through multiple hierarchical views. Technical Report 95-08, Georgia Institute of Technology, Graphics, Visualization and Usability Center, College of Computing, Atlanta, GA 30332-0280, 1995. Also appeared in the Proceedings of the ACM SIGCHI CHI'95, May 1995, Denver, Colorado.Google Scholar
- 7.G. Zinssmeister and C. McCreary. Drawing graphs with attribute graph grammars. In Graph Grammar Workshop, pages 355–360, Williamsburg, 1994.Google Scholar