Graph Clustering Using Multiway Ratio Cut (Software Demonstration)
Roxborough, Tom and Sen, Arunabha (1998) Graph Clustering Using Multiway Ratio Cut (Software Demonstration). In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 291-296 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_71).
Full text not available from this repository.
Identifying the natural clusters of nodes in a graph and treating them as supernodes or metanodes for a higher level graph (on 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.
Repository Staff Only: item control page