Graph clustering using multiway ratio cut (Software demonstration)

Tom Roxborough; Arunabha Sen

doi:10.1007/3-540-63938-1_71

Graph clustering using multiway ratio cut (Software demonstration)

Tom Roxborough, Arunabha Sen

Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

18 Scopus citations

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.

Original language	English (US)
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher	Springer Verlag
Pages	291-296
Number of pages	6
Volume	1353
ISBN (Print)	9783540639381
DOIs	https://doi.org/10.1007/3-540-63938-1_71
State	Published - 1997
Event	5th International Symposium on Graph Drawing, GD 1997 - Rome, Italy Duration: Sep 18 1997 → Sep 20 1997

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1353
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	5th International Symposium on Graph Drawing, GD 1997
Country/Territory	Italy
City	Rome
Period	9/18/97 → 9/20/97

ASJC Scopus subject areas

General Computer Science
Theoretical Computer Science

Access to Document

10.1007/3-540-63938-1_71

Cite this

Roxborough, T., & Sen, A. (1997). Graph clustering using multiway ratio cut (Software demonstration). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1353, pp. 291-296). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1353). Springer Verlag. https://doi.org/10.1007/3-540-63938-1_71

Graph clustering using multiway ratio cut (Software demonstration). / Roxborough, Tom; Sen, Arunabha.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1353 Springer Verlag, 1997. p. 291-296 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1353).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Roxborough, T & Sen, A 1997, Graph clustering using multiway ratio cut (Software demonstration). in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1353, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1353, Springer Verlag, pp. 291-296, 5th International Symposium on Graph Drawing, GD 1997, Rome, Italy, 9/18/97. https://doi.org/10.1007/3-540-63938-1_71

Roxborough T, Sen A. Graph clustering using multiway ratio cut (Software demonstration). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1353. Springer Verlag. 1997. p. 291-296. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-63938-1_71

Roxborough, Tom ; Sen, Arunabha. / Graph clustering using multiway ratio cut (Software demonstration). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1353 Springer Verlag, 1997. pp. 291-296 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{42c5dfb812404af29c327c2febdd1ddf,

title = "Graph clustering using multiway ratio cut (Software demonstration)",

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.",

author = "Tom Roxborough and Arunabha Sen",

year = "1997",

doi = "10.1007/3-540-63938-1_71",

language = "English (US)",

isbn = "9783540639381",

volume = "1353",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "291--296",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

note = "5th International Symposium on Graph Drawing, GD 1997 ; Conference date: 18-09-1997 Through 20-09-1997",

}

TY - GEN

T1 - Graph clustering using multiway ratio cut (Software demonstration)

AU - Roxborough, Tom

AU - Sen, Arunabha

PY - 1997

Y1 - 1997

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 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.

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 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.

UR - http://www.scopus.com/inward/record.url?scp=84957369808&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84957369808&partnerID=8YFLogxK

U2 - 10.1007/3-540-63938-1_71

DO - 10.1007/3-540-63938-1_71

M3 - Conference contribution

AN - SCOPUS:84957369808

SN - 9783540639381

VL - 1353

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 291

EP - 296

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

T2 - 5th International Symposium on Graph Drawing, GD 1997

Y2 - 18 September 1997 through 20 September 1997

ER -

Graph clustering using multiway ratio cut (Software demonstration)

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this