Skip to main content
SpringerLink
Log in

Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 2001 (MFCS 2001)

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

Abstract

We derive new upper bounds on the bisection width of graphs which have a regular vertex degree. We show that the bisection width of large 3-regular graphs with ∣V∣ vertices is at most 1/6∣V∣. For the bisection width of large 4-regular graphs we show an upper bound of 2/5 ∣V∣.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. N. Alon. On the edge-expansion of graphs. Combinatorics, Probability and Computing, 6:145–152, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  2. S. L. Bezroukov, R. Elsässer, B. Monien, R. Preis, and J.-P. Tillich. New spectral lower bounds on the bisection width of graphs. In Workshop on Graph-Theoretic Concepts in Computer Science (WG), LNCS 1928, pages 23–34, 2000.

    Chapter  Google Scholar 

  3. B. Bollobas. The isoperimetric number of random regular graphs. Europ. J. Combinatorics, 9:241–244, 1988.

    MATH  MathSciNet  Google Scholar 

  4. C. F. Bornstein, A. Litman, B. M. Maggs, R. K. Sitaraman, and T. Yatzkar. On the bisection width and expansion of butterfly networks. In Proc. Int. Parallel Processing Symp. (IPPS), pages 144–150, 1998.

    Google Scholar 

  5. T. N. Bui, S. Chaudhuri, F. T. Leighton, and M. Sisper. Graph bisection algorithms with good average case behaviour. Combinatorica, 7(2):171–191, 1987.

    Article  MathSciNet  Google Scholar 

  6. P. Chiu. Cubic ramanujan graphs. Combinatorica, 12(3):275–285, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  7. L. H. Clark and R. C. Entringer. The bisection width of cubic graphs. Bulletin of th Australian Mathematical Society, 39:389–396, 1988.

    Article  MathSciNet  Google Scholar 

  8. R. Diekmann, B. Monien, and R. Preis. Using helpful sets to improve graph bisections. In Interconnection Networks and Mapping and Scheduling Parallel Computations, pages 57–73. AMS, 1995.

    Google Scholar 

  9. U. Feige and R. Krauthgamer. A polylogarithmic approximation of the minimum bisection. In Symp. on Found. of Computer Science (FOCS), pages 105–115, 2000.

    Google Scholar 

  10. M. Fiedler. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Math. J., Praha, 25(100):619–633, 1975.

    MathSciNet  Google Scholar 

  11. M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237–267, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  12. B. Hendrickson and R. Leland. Chaco 2.0. Technical Report 94-2692, Sandia, 1994.

    Google Scholar 

  13. J. Hromkovič and B. Monien. The bisection problem for graphs of degree 4. In Festschrift zum 60. Geburtstag von Günter Hotz, pages 215–234. Teubner, 1992.

    Google Scholar 

  14. G. Karypis and V. Kumar. METIS Manual 4.0. University of Minnesota, 1998.

    Google Scholar 

  15. A. V. Kostochka and L. S. Melnikov. On bounds of the bisection width of cubic graphs. In Czech. Symp. on Comb., Graphs and Complexity, pages 151–154, 1992.

    Google Scholar 

  16. A. V. Kostochka and L. S. Melnikov. On a lower bound for the isoperimetric number of cubic graphs. In Probabilistic Methods in Discrete Math., pages 251–265, 1993.

    Google Scholar 

  17. A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8(3):261–277, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  18. Y. Manabe, K. Hagihara, and N. Tokura. The minimum bisection widths of the cube-connected cycles graph and cube graph. Transactions of the IEICE, J67-D(6):647–654, 1994. (in Japanese).

    Google Scholar 

  19. G. A. Margulis. Explicit group-theoretical constructions of combinatorial schemes. Probl. Inf. Transm., 24(1):39–46, 1988.

    MATH  MathSciNet  Google Scholar 

  20. B. Monien and R. Diekmann. A local graph partitioning heuristic meeting bisection bounds. In 8th SIAM Conf. on Parallel Processing for Scientific Computing, 1997.

    Google Scholar 

  21. B. Monien, R. Preis, and R. Diekmann. Quality matching and local improvement for multilevel graph-partitioning. Parallel Computing, 26(12):1609–1634, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  22. M. Morgenstern. Existence and explicit constructions of q + 1 regular ramanujan graphs for every prime power q. J. Comb. Theory, Ser. B, 62(1):44–62, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  23. F. Pellegrini. SCOTCH 3.1. Technical Report 1137-96, University of Bordeaux, 1996.

    Google Scholar 

  24. R. Preis. Analyses and Design of Efficient Graph Partitioning Methods. Heinz Nixdorf Institut Verlagsschriftenreihe, 2000. Dissertation, Universität Paderborn.

    Google Scholar 

  25. C. Walshaw. The Jostle user manual: Version 2.2. University of Greenwich, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Paderborn, D-33098, Paderborn, Germany

    Burkhard Monien & Robert Preis

Authors
  1. Burkhard Monien
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert Preis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematical Institute, AS CR, Žitná 25, 115 67, Praha 1, Czech Republic

    Jiří Sgall

  2. Faculty of Mathematics and Physics Institute for Theoretical Computer Science (ITI), Charles University, Malostranské náměstí 25, 118 00, Praha 1, Czech Republic

    Aleš Pultr  & Petr Kolman  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monien, B., Preis, R. (2001). Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. In: Sgall, J., Pultr, A., Kolman, P. (eds) Mathematical Foundations of Computer Science 2001. MFCS 2001. Lecture Notes in Computer Science, vol 2136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_46

Download citation

  • DOI: https://doi.org/10.1007/3-540-44683-4_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42496-3

  • Online ISBN: 978-3-540-44683-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation