DocumentCode
356033
Title
A ratio-cut partitioning algorithm using node contraction
Author
Saab, Youssef
Author_Institution
Dept. of Comput. Eng. & Comput. Sci., Missouri Univ., Columbia, MO, USA
Volume
1
fYear
1999
fDate
1999
Firstpage
210
Abstract
This paper describes a new simple ratio-cut partitioning algorithm using node contraction. This new algorithm combines iterative improvement with progressive cluster formation. Under suitably mild assumptions, the new algorithm runs in linear time. It is also shown that the new algorithm compares favorably with previous approaches
Keywords
circuit analysis computing; graph theory; iterative methods; network topology; iterative improvement; linear time algorithm; node contraction; progressive cluster formation; ratio-cut partitioning algorithm; Circuits; Clustering algorithms; Computer science; Costs; Cyclic redundancy check; Iterative algorithms; Iterative methods; Partitioning algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1999. 42nd Midwest Symposium on
Conference_Location
Las Cruces, NM
Print_ISBN
0-7803-5491-5
Type
conf
DOI
10.1109/MWSCAS.1999.867245
Filename
867245
Link To Document