Partitioning Planar Graphs with Costs and Weights
A graph separator is a set of vertices or edges whose removal divides an input graph into components of bounded size. This paper describes new algorithms for computing separators in planar graphs as well as techniques that can be used to speed up their implementation and improve the partition quality. In particular, we consider planar graphs with costs and weights on the vertices, where weights are used to estimate the sizes of the components and costs are used to estimate the size of the separator. We show that one can find a small separator that divides the graph into components of bounded size. We describe implementations of the partitioning algorithms and discuss results of our experiments.
KeywordsShort Path Planar Graph Short Path Problem Graph Partitioning Outerplanar Graph
Unable to display preview. Download preview PDF.
- 2.W. J. Camp, S. J. Plimpton, B. A. Hendrickson, and R. W. Leland. Massively parallel methods for engineering and science problems. Communications of the ACM, 37(4):30–41, April 1994.Google Scholar
- 7.B. Hendrickson and R. Leland. The Chaco user’s guide — version 2.0, Sandia National Laboratories, Technical Report SAND94-2692, 1994.Google Scholar
- 8.Monika R. Henzinger, Philip Klein, Satish Rao, and Sairam Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 55(1):3–23, August 1997.Google Scholar
- 9.B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, pages 291–307, February 1970.Google Scholar
- 12.H.S. Maini, K.G. Mehrotra, C.K. Mohan, S. Ranka, Genetic algorithms for graph partitioning and incremental graph partitioning, CRPC-TR-94504, Rice University, 1994.Google Scholar
- 13.A. Pothen, H. D. Simon, and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 11(3):430–452, July 1990.Google Scholar
- 14.K. Schloegel, G. Karypis, and V. Kumar. Graph Partitioning for High Performance Scientific Simulations. In J. Dongarra et al., editor, CRPC Parallel Computing Handbook. Morgan Kaufmann (in press).Google Scholar