Skip to main content
SpringerLink
Log in

Minimum Cycle Bases of Weighted Outerplanar Graphs

  • Conference paper
Algorithms and Computation (ISAAC 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5878))

Included in the following conference series:

Abstract

We give the first known optimal algorithm that computes a minimum cycle basis for any weighted outerplanar graph. Specifically, for any n-node edge-weighted outerplanar graph G, we give an O(n)-time algorithm to obtain an O(n)-space compact representation Z(ℂ) for a minimum cycle basis ℂ of G. Each cycle in ℂ can be computed from Z(ℂ) in O(1) time per edge. Our result works for directed and undirected outerplanar graphs G.

Research supported in part by NSC grants 97-2221-E-002-122 and 98-2221-E-002-079-MY3.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Mehlhorn, K., Michail, D.: Minimum cycle bases: Faster and simpler. ACM Transactions on Algorithms (accepted)

    Google Scholar 

  2. Liebchen, C., Rizzi, R.: Classes of cycle bases. Discrete Applied Mathematics 155(3), 337–355 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Mehlhorn, K.: Minimum cycle bases in graphs – algorithms and applications. In: Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, pp. 13–14 (2007)

    Google Scholar 

  4. Kavitha, T., Liebchen, C., Mehlhorn, K., Michail, D., Rizzi, R., Ueckerdt, T., Zweig, K.A.: Cycle bases in graphs characterization, algorithms, complexity, and applications. Computer Science Review (to appear)

    Google Scholar 

  5. Horton, J.D.: A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM Journal on Computing 16(2), 358–366 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kolasinska, E.: On a minimum cycle basis of a graph. Zastosowania Matematyki 16, 631–639 (1980)

    MATH  MathSciNet  Google Scholar 

  7. Hubicka, E., Syslo, M.M.: Minimal bases of cycle of a graph. In: Fiedler, M. (ed.) Recent Advances in Graph Theory, the 2nd Czech Symposium in Graph Theory, pp. 283–293 (1975)

    Google Scholar 

  8. de Pina, J.C.: Applications of Shortest Path Methods. PhD thesis, University of Amsterdam, Netherlands (1995)

    Google Scholar 

  9. Berger, F., Gritzmann, P., de Vries, S.: Minimum cycle bases for network graphs. Algorithmica 40, 51–62 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  10. Golynski, A., Horton, J.D.: A polynomial time algorithm to find the minimum cycle basis of a regular matroid. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol. 2368, pp. 200–209. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9(3), 251–280 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  12. Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: A faster algorithm for minimum cycle basis of graphs. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 846–857. Springer, Heidelberg (2004)

    Google Scholar 

  13. Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.E.: An Õ(m2n) algorithm for minimum cycle basis of graphs. Algorithmica 52(3), 333–349 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  14. Michail, D.: Minimum Cycle Basis. PhD thesis, Saarland University, Germany (2006)

    Google Scholar 

  15. Mehlhorn, K., Michail, D.: Implementing minimum cycle basis algorithms. Journal of Experimental Algorithmics 11, 2.5 (2006)

    MathSciNet  Google Scholar 

  16. Amaldi, E., Iuliano, C., Jurkiewicz, T., Mehlhorn, K., Rizzi, R.: Breaking the O(m2n) barrier for minimum cycle bases. In: Proceedings of the the 17th European Symposium on Algorithms, pp. 301–312 (2009)

    Google Scholar 

  17. Kavitha, T., Mehlhorn, K., Michail, D.: New approximation algorithms for minimum cycles bases of graphs. In: Proceedings of the 24th Symposium on Theoretical Aspects of Computer Science, pp. 512–523 (2007)

    Google Scholar 

  18. Hammack, R.: Minimum cycle bases of direct products of bipartite graphs. Australasian Journal of Combinatorics 36, 213–221 (2006)

    MATH  MathSciNet  Google Scholar 

  19. Hammack, R.: Minimum cycle bases of direct products of complete graphs. Information Processing Letters 102(5), 214–218 (2007)

    Article  MathSciNet  Google Scholar 

  20. Stadler, P.F.: Minimum cycle bases of halin graphs. Journal of Graph Theory 43(2), 150–155 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  21. Imrich, W., Stadler, P.F.: Minimum cycle bases of product graphs. Australasian Journal of Combinatorics 26, 233–244 (2002)

    MATH  MathSciNet  Google Scholar 

  22. Jaradat, M.M.: On the basis number and the minimum cycle bases of the wreath product of some graphs. Discussiones Mathematicae Graph Theory 26, 113–134 (2006)

    MATH  MathSciNet  Google Scholar 

  23. Jaradat, M.M., Al-Qeyyam, M.K.: On the basis number and the minimum cycle bases of the wreath product of two wheels. International Journal of Mathematical Combinatorics 1, 52–62 (2008)

    MATH  MathSciNet  Google Scholar 

  24. Hartvigsen, D., Mardon, R.: The all-pairs min cut problem and the minimum cycle basis problem on planar graphs. SIAM Journal on Discrete Mathematics 7(3), 403–418 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  25. Leydold, J., Stadler, P.F.: Minimal cycle bases of outerplanar graphs. Electronic Journal of Combinatorics 5, 209–222 (1998)

    MathSciNet  Google Scholar 

  26. Frederickson, G.N., Janardan, R.: Designing networks with compact routing tables. Algorithmica 3, 171–190 (1988)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Taiwan University,  

    Tsung-Hao Liu & Hsueh-I. Lu

Authors
  1. Tsung-Hao Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hsueh-I. Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Electrical and Computer Engineering, University of Hawaii, Holmes Hall 483, 2540 Dole Street, 96822, Honolulu, HI, USA

    Yingfei Dong

  2. Department of Computer Science, University of Texas at Dallas, 75083, Dallas, TX, USA

    Ding-Zhu Du

  3. Department of Computer Science, University of California, 93106, Santa Barbara, CA, USA

    Oscar Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, TH., Lu, HI. (2009). Minimum Cycle Bases of Weighted Outerplanar Graphs. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_58

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10631-6_58

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10630-9

  • Online ISBN: 978-3-642-10631-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation