Skip to main content
Springer Nature Link
Log in

Partitioning Planar Graphs with Costs and Weights

  • Conference paper
  • First Online:
Algorithm Engineering and Experiments (ALENEX 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2409))

Included in the following conference series:

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.

Research supported in part by NSERC and NCE GEOIDE. Second author was partially supported by the EPSRC grant GR/M60750, RTDF grant 98/99-0140, and IST Programme of the EU, Contract IST-1999-14186, ALCOM-FT.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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. 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.

    Article  MathSciNet  Google Scholar 

  4. H. N. Djidjev. Partitioning planar graphs with vertex costs: Algorithms and applications. Algorithmica, 28(1):51–75, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  5. Hristo N. Djidjev. On the problem of partitioning planar graphs. SIAM Journal on Algebraic and Discrete Methods, 3:229–240, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  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 

  10. Richard J. Lipton and Robert E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math, 36:177–189, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  11. K. Mehlhorn and S. Näher. Leda, a platform for combinatorial and geometric computing. Communications of ACM, 38:96–102, 1995.

    Article  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 

Download references

Author information

Authors and Affiliations

  1. Bulgarian Academy of Sciences, Sofia, Bulgaria

    Lyudmil Aleksandrov

  2. Dept. of Computer Science, University of Warwick, Coventry, UK

    Hristo Djidjev

  3. School of Computer Science, Carleton University, Ottawa, Canada

    Lyudmil Aleksandrov, Hua Guo & Anil Maheshwari

Authors
  1. Lyudmil Aleksandrov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hristo Djidjev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hua Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Anil Maheshwari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Maryland, College Park, MD, 20742, USA

    David M. Mount

  2. Department of IEOR, Columbia University, 500W. 120 St., MC 4704, New York, NY, 10027, USA

    Clifford Stein

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aleksandrov, L., Djidjev, H., Guo, H., Maheshwari, A. (2002). Partitioning Planar Graphs with Costs and Weights. In: Mount, D.M., Stein, C. (eds) Algorithm Engineering and Experiments. ALENEX 2002. Lecture Notes in Computer Science, vol 2409. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45643-0_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-45643-0_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43977-6

  • Online ISBN: 978-3-540-45643-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics