Abstract
In a seminal paper (An efficient heuristic procedure for partitioning graphs, Bell System Technical Journal, 49 (1970), pp. 291–307), Kernighan and Lin propose a pair exchange algorithm for approximating the solution to min-cut graph partitioning problems. In their algorithm, a vertex from one set in the current partition is exchanged with a vertex in the other set to reduce the sum of the weights of cut edges. The exchanges continue until the total weight of the cut edges is no longer reduced. In this paper, we consider a block exchange algorithm in which a group of vertices from one set is exchanged with a group of vertices from the other set in order to minimize the sum of the weights of cut edges. An optimal choice for the exchanged vertices is the solution to a quadratic programming problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. W. Kernighan and S. Lin (1970), “An efficient heuristic procedure for partitioning graphs,” Bell System Technical Journal, vol. 49, pp. 291–307.
W. W. Hager and Y. Krylyuk (to appear), “Graph partitioning and continuous quadratic programming,” SIAM J. Discrete Math.
B. Hendrickson and E. Rothberg (1997), “Improving the runtime and quality of nested dissection ordering,” Technical report, Sandia National Laboratories, Albuquerque, NM.
G. Karypis and V. Kumar (1995), “METIS: Unstructured graph partitioning and sparse matrix ordering system,” Technical report, Dept. of Computer Science, Univ. of Minnesota.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Hager, W.W., Park, S.C., Davis, T.A. (2000). Block Exchange in Graph Partitioning. In: Pardalos, P.M. (eds) Approximation and Complexity in Numerical Optimization. Nonconvex Optimization and Its Applications, vol 42. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3145-3_17
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3145-3_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4829-8
Online ISBN: 978-1-4757-3145-3
eBook Packages: Springer Book Archive