The graph partitioning problem is to divide the vertices of a graph into disjoint clusters to minimize the total cost of the edges cut by the clusters. A spectral partitioning heuristic uses the graph's eigenvectors to construct a geometric representation of the graph (e.g., linear orderings) which are subsequently partitioned. Our main result shows that when all the eigenvectors are used, graph partitioning reduces to a new vector partitioning problem. This result implies that as many eigenvectors as are practically possible should be used to construct a solution. This philosophy is in contrast to that of the widely-used spectral bipartitioning (SB) heuristic (which uses a single eigenvector to construct a 2-way partitioning) and several previous multiway
|
634
|
Improved approximation algorithms for Maximum Cut and Satisfiability problems using semidefinite programming
– Goemans, Williamson
- 1995
|
|
442
|
Partitioning sparse matrices with eigenvectors of graphs
– Pothen, Simon, et al.
- 1990
|
|
382
|
Combinatorial Algorithms for Integrated Circuit Layout
– Lengauer
- 1990
|
|
267
|
A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems
– Barnard, Simon
- 1994
|
|
208
|
Algebraic connectivity of graphs
– Fiedler
- 1973
|
|
180
|
Recent directions in netlist partitioning: A survey
– Alpert, Kahng
- 1995
|
|
161
|
An improved spectral graph partitioning algorithm for mapping parallel computations
– Hendrickson, Leland
- 1995
|
|
148
|
Improved approximation algorithms for MAX k-CUT
– Frieze, Jerrum
- 1995
|
|
145
|
New Spectral Methods for Ratio Cut Partitioning and Clustering
– Hagen, Kahng
- 1992
|
|
119
|
Lower bounds for the partitioning of graphs
– Donath, Hoffman
- 1973
|
|
115
|
An r-dimensional quadratic placement algorithm
– Hall
- 1970
|
|
112
|
Multiple-way network partitioning
– Sanchis
- 1989
|
|
104
|
Spectral partitioning works: planar graphs and finite element meshes
– Spielman, Teng
- 1996
|
|
86
|
Spectral k-way ratio-cut partitioning and clustering
– Chan, Schlag, et al.
- 1993
|
|
82
|
The Laplacian spectrum of graphs
– Mohar
- 1991
|
|
68
|
An algorithm for partitioning the nodes of a graph
– Barnes
- 1982
|
|
52
|
Laplacian eigenvalues and the maximum cut problem
– Delorme, Poljak
- 1993
|
|
51
|
A projection technique for partitioning the nodes of a graph
– Rendl, Wolkowicz
- 1995
|
|
46
|
A new approach to effective circuit clustering
– Hagen, Kahng
- 1992
|
|
40
|
Partitioning Very Large Circuits Using Analytical Placement Techniques
– Riess, Doll, et al.
- 1994
|
|
38
|
A computational study of graph partitioning
– Falkner, Rendl, et al.
- 1994
|
|
37
|
Towards efficient hierarchical designs by ratio cut partitioning
– Wei, Cheng
- 1989
|
|
36
|
A general framework for vertex orderings, with applications to netlist clustering
– Alpert, Kahng
- 1994
|
|
33
|
The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices
– Cullum, Donath, et al.
- 1975
|
|
32
|
Finding clusters in vlsi circuits
– Garbers, Promel, et al.
- 1990
|
|
29
|
Geometric embeddings for faster and better multi-way netlist partitioning
– Alpert, Kahng
- 1993
|
|
26
|
On the performance of spectral graph partitioning methods
– Guattery, Miller
- 1995
|
|
24
|
Recent Developments in Netlist Partitioning: A Survey
– Alpert, Kahng
- 1995
|
|
23
|
A Unified Approach to Partitioning and Placement
– Tsay, Kuh
- 1991
|
|
22
|
Circuit Placements and Cost Bounds by Eigenvector Decomposition
– Frankle, Karp
- 1986
|
|
22
|
A new heuristic for partitioning the nodes of a graph
– BARNES, VANNELLI, et al.
- 1988
|
|
20
|
Logic partitioning
– Donath
- 1988
|
|
18
|
Multi-way partitioning via spacefilling curves and dynamic programming
– Alpert, Kahng
- 1994
|
|
15
|
A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs
– Bui, Moon
- 1994
|
|
15
|
An efficient eigenvector approach for finding netlist partitions
– Hadley, Mark, et al.
- 1992
|
|
14
|
Modeling hypergraphs by graphs with the same mincut properties
– Ihler, Wagner, et al.
- 1993
|
|
13
|
The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
– Delorme, Poljak
- 1993
|
|
12
|
Kahng, "A New Approach to Effective Circuit Clustering
– Hagen, B
- 1992
|
|
8
|
Near-optimal placement using a quadratic objective function
– Blanks
- 1985
|
|
8
|
Multiway Partitioning Via Geometric Embeddings, Orderings, and Dynamic Programming
– Alpert, Kahng
- 1995
|
|
8
|
Efficient Partitioning of Components
– Charney, Plato
- 1968
|
|
5
|
Agule, \A Study of Placement Techniques
– Hanan, Wol
- 1978
|
|
5
|
A Quadratic Metric with a Simple Solution Scheme for Initial Placement
– Pillage, Rohrer
- 1988
|
|
5
|
LASO2 Documentation
– Scott
- 1980
|
|
4
|
New heuristics and lower bounds for graph partitioning
– Arun, Rao
- 1991
|
|
3
|
Multiterimnal flows in hypergraphs
– Hu, Moerder
- 1985
|
|
1
|
The indefinite zero-one quadratic problem, Discrete Applied Mathematics 7
– Carter
- 1984
|
|
1
|
Solving the max-cut problem using eigenvalues, Discrete Applied Mathematics 62
– Poljak, Rendl
- 1995
|
|
