## Graph Clustering Using Distance-k Cliques
Edachery, Jubin and Sen, Arunabha and Brandenburg, Franz J.
(1999)
Full text not available from this repository. ## AbstractIdentifying 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.
Repository Staff Only: item control page References |