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 ratio cut, a well known technique used for circuit partitioning in the VLSI domain. The algorithm is implemented in WINDOWS95/NT environment. The performance of the clustering algorithm on some large graphs obtained from the archives of Bell Laboratories is presented.
This work was partially supported by a grant from Tom Sawyer Software under NIST Advanced Technology Program.
Chapter PDF
Similar content being viewed by others
References
R. Sablowski and A. Frick, “Automatic Graph Clustering,” Proceedings of Graph Drawing'96, Berkeley, California, September,1996.
U. Dogrusoz, B. Madden and P. Madden, “Circular Layout in the Graph Layout Toolkit,” Proceedings of Graph Drawing'96, Berkeley, California, September,1996.
P. Eades, “Multilevel Visualization of Clustered Graphs,” Proceedings of Graph Drawing'96, Berkeley, California, September,1996.
Y. C. Wei and C. K. Cheng, “Ratio Cut Partitioning for Hierarchical Designs,” IEEE Transactions on Computer Aided Design, vol. 10, no. 7, pp.911–921, July 1991.
C. J. Alpert and A. B. Kahng, “Recent Directions in Netlist Partitioning: A Survey,” INTEGRATION: the VLSI journal, vol. 19, pp.1–81,1995.
D. Kimmelman, B. Leban, T. Roth, D. Zernik “Dynamic Graph Abstraction for Effective Software Visualization,” The Australian Computer Journal, vol. 27, no. 4, pp.129–137, Nov 1995.
F. J. Brandenburg, M. Himsolt and K. Skodinis, “Graph Clustering: Circles of Cliques,” submitted to Graph Drawing'97.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roxborough, T., Sen, A. (1997). Graph clustering using multiway ratio cut (Software demonstration). In: DiBattista, G. (eds) Graph Drawing. GD 1997. Lecture Notes in Computer Science, vol 1353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63938-1_71
Download citation
DOI: https://doi.org/10.1007/3-540-63938-1_71
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63938-1
Online ISBN: 978-3-540-69674-2
eBook Packages: Springer Book Archive