Efficient multiple-way graph partitioning algorithms
- Bilkent Univ., Ankara (Turkey)
Graph partitioning deals with evenly dividing a graph into two or more parts such that the total weight of edges interconnecting these parts, i.e., cutsize, is minimized. Graph partitioning has important applications in VLSI layout, mapping, and sparse Gaussian elimination. Since graph partitioning problem is NP-hard, we should resort to polynomial-time algorithms to obtain a good solution, or hopefully a near-optimal solution. Kernighan-Lin (KL) propsoed a 2-way partitioning algorithms. Fiduccia-Mattheyses (FM) introduced a faster version of KL algorithm. Sanchis (FMS) generalized FM algorithm to a multiple-way partitioning algorithm. Simulated Annealing (SA) is one of the most successful approaches that are not KL-based.
- OSTI ID:
- 125591
- Report Number(s):
- CONF-950212--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Graph Partitioning and Sequencing Software
Graph-dissection techniques for VLSI and algorithms