Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms

Thang Nguyen Bui, Christopher Heigham, Curt Jones, Tom Leighton

Research output: Contribution to journalArticle

61 Citations (Scopus)

Abstract

It is shown that Kernighan-Lin and simulated annealing perform better as the average degree of the graph increases. An empirical study of a compaction heuristic that dramatically improves the performance of these bisection algorithms on graphs with a small (≤4) average degree is presented. The performance increase was in both the quality of the solution and the speed in which it was obtained. Kernighan-Lin was found to be a much faster algorithm than simulated annealing on the graphs tested.

Original languageEnglish (US)
Pages (from-to)775-778
Number of pages4
JournalProceedings - Design Automation Conference
StatePublished - 1989

Fingerprint

Simulated annealing
Compaction

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

@article{77625a878d7d46d4a39274aa62a70d98,
title = "Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms",
abstract = "It is shown that Kernighan-Lin and simulated annealing perform better as the average degree of the graph increases. An empirical study of a compaction heuristic that dramatically improves the performance of these bisection algorithms on graphs with a small (≤4) average degree is presented. The performance increase was in both the quality of the solution and the speed in which it was obtained. Kernighan-Lin was found to be a much faster algorithm than simulated annealing on the graphs tested.",
author = "Bui, {Thang Nguyen} and Christopher Heigham and Curt Jones and Tom Leighton",
year = "1989",
language = "English (US)",
pages = "775--778",
journal = "Proceedings - Design Automation Conference",
issn = "0738-100X",

}

Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms. / Bui, Thang Nguyen; Heigham, Christopher; Jones, Curt; Leighton, Tom.

In: Proceedings - Design Automation Conference, 1989, p. 775-778.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms

AU - Bui, Thang Nguyen

AU - Heigham, Christopher

AU - Jones, Curt

AU - Leighton, Tom

PY - 1989

Y1 - 1989

N2 - It is shown that Kernighan-Lin and simulated annealing perform better as the average degree of the graph increases. An empirical study of a compaction heuristic that dramatically improves the performance of these bisection algorithms on graphs with a small (≤4) average degree is presented. The performance increase was in both the quality of the solution and the speed in which it was obtained. Kernighan-Lin was found to be a much faster algorithm than simulated annealing on the graphs tested.

AB - It is shown that Kernighan-Lin and simulated annealing perform better as the average degree of the graph increases. An empirical study of a compaction heuristic that dramatically improves the performance of these bisection algorithms on graphs with a small (≤4) average degree is presented. The performance increase was in both the quality of the solution and the speed in which it was obtained. Kernighan-Lin was found to be a much faster algorithm than simulated annealing on the graphs tested.

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

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

M3 - Article

SP - 775

EP - 778

JO - Proceedings - Design Automation Conference

JF - Proceedings - Design Automation Conference

SN - 0738-100X

ER -