A k-way graph partitioning algorithm based on clustering by eigenvector

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

Volumn 3037, Issue , 2004, Pages 598-601

  Choe, Tae Young ^a   Park, Chan Ik ^b  

^a Kumoh National Institute of Technology   (South Korea)

^b Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AXIAL FLOW; GRAPH THEORY;

BIPARTITION; CUT SETS; GRAPH PARTITION; GRAPH PARTITIONING ALGORITHMS; MULTILEVELS;

CLUSTERING ALGORITHMS;

EID: 35048898340     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24687-9_81     Document Type: Article

References (7)

1. Bui, T.N., Jones, C.: Finding good approximate vertex and edge partitions is NP-hard. Information Processing Letters 42 (1992) 153-159
2. Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing 20 (1999) 359-392
3. Simon, H.D., Sohn, A., Biswas, R.: Harp: A dynamic spectral partitioner. Journal of Parallel and Distributed Computing 50 (1998) 83-103
4. Hsieh, S.H., Paulino, G.H., Abel, J.F.: Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis. Comput. Methods Appl. Mech. Engrg. (1995) 137-162
5. Hagen, Kahng: New spectral methods for ratio cut partitioning and clustering. IEEETCAD: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 11 (1992)
6. Sanchis, L.: Multiple-way network partitioning. IEEE Trans. Computers 38 (1989)
7. Park, C.I., Park, Y.B.: An efficient algorithm for vlsi network partitioning problem using a cost function with balancing factor. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 12 (1993)