Abstract
Let V be the set of 2n nodes of a complete graph with an associated 2n by 2n symmetric cost matrix (cij) on its edges. The graph partitioning problem is to partition the nodes into two parts P and Q = V - P, each with n nodes, such that the total cost of the edges cut
is minimized.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliographic Notes
The two-way graph partitioning heuristic algorithm comes from B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs”, Bell System Technical Journal 49(1970), 291–307.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lau, H.T. (1986). Graph Partitioning. In: Combinatorial Heuristic Algorithms with FORTRAN. Lecture Notes in Economics and Mathematical Systems, vol 280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61649-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-61649-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17161-4
Online ISBN: 978-3-642-61649-5
eBook Packages: Springer Book Archive