TY - GEN
T1 - Graph clustering using distance-k cliques software demonstration
AU - Edachery, Jubin
AU - Sen, Arunabha
AU - Brandenburg, Franz J.
PY - 1999
Y1 - 1999
N2 - 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 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.
AB - 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 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.
UR - http://www.scopus.com/inward/record.url?scp=84958977543&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84958977543&partnerID=8YFLogxK
U2 - 10.1007/3-540-46648-7_10
DO - 10.1007/3-540-46648-7_10
M3 - Conference contribution
AN - SCOPUS:84958977543
SN - 3540669043
SN - 9783540669043
VL - 1731
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 98
EP - 106
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PB - Springer Verlag
T2 - 7th International Symposium on Graph Drawing, GD 1999
Y2 - 15 September 1999 through 19 September 1999
ER -