DocumentCode
450709
Title
Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms
Author
Bui, Thang ; Jones, Curt ; Heigham, Christopher ; Leighton, Tom
Author_Institution
Computer Science Department, Pennsylvania State University, University Park, PA
fYear
1989
fDate
25-29 June 1989
Firstpage
775
Lastpage
778
Abstract
In this paper, we compare the performance of two popular graph bisection algorithms. We also present an empirical study of a new heuristic, first proposed in [B87], that dramatically improves the performance of these bisection algorithms on graphs with small (≤ 4) average degree.
Keywords
Compaction; Computational modeling; Computer science; Computer simulation; Contracts; Mesh generation; Permission; Simulated annealing; Testing; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation, 1989. 26th Conference on
ISSN
0738-100X
Print_ISBN
0-89791-310-8
Type
conf
DOI
10.1109/DAC.1989.203508
Filename
1586492
Link To Document