Graph clustering using multiway ratio cut (Software demonstration) [chapter]

Tom Roxborough, Arunabha Sen
1997 Lecture Notes in Computer Science  
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.
doi:10.1007/3-540-63938-1_71 fatcat:5of34wqu3bbwbhpyxjgymuyqqa