Advertisement

Partitioning Planar Graphs with Costs and Weights

  • Lyudmil Aleksandrov
  • Hristo Djidjev
  • Hua Guo
  • Anil Maheshwari
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2409)

Abstract

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.

Keywords

Short Path Planar Graph Short Path Problem Graph Partitioning Outerplanar Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    L. Aleksandrov and H. Djidjev, Linear Algorithms for partitioning embedded graphs of bounded genus, SIAM J. Disc. Math., Vol. 9, No. 1, pp. 129–150, Feb. 1996.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 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
  3. 3.
    K. Diks, H. N. Djidjev, O. Sykora, and I. Vrto. Edge separators of planar graphs and outerplanar graphs with applications. J. Algorithms, 34:258–279, 1993.CrossRefMathSciNetGoogle Scholar
  4. 4.
    H. N. Djidjev. Partitioning planar graphs with vertex costs: Algorithms and applications. Algorithmica, 28(1):51–75, 2000.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Hristo N. Djidjev. On the problem of partitioning planar graphs. SIAM Journal on Algebraic and Discrete Methods, 3:229–240, 1982.zbMATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    John. R. Gilbert, Gary L. Miller, and Shang-Hua Teng. Geometric mesh partitioning: Implementation and experiments. SIAM Journal on Scientific Computing, 19(6):2091–2110, 1998.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 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. 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. 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
  10. 10.
    Richard J. Lipton and Robert E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math, 36:177–189, 1979.zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    K. Mehlhorn and S. Näher. Leda, a platform for combinatorial and geometric computing. Communications of ACM, 38:96–102, 1995.CrossRefGoogle Scholar
  12. 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. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Lyudmil Aleksandrov
    • 1
    • 3
  • Hristo Djidjev
    • 2
  • Hua Guo
    • 3
  • Anil Maheshwari
    • 3
  1. 1.Bulgarian Academy of SciencesSofiaBulgaria
  2. 2.Dept. of Computer ScienceUniversity of WarwickCoventryUK
  3. 3.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations