Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 2011: Algorithms – ESA 2011 pp 155–166Cite as

Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time

  • Conference paper

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

Abstract

We present a deterministic O(n loglogn) time algorithm for finding shortest cycles and minimum cuts in planar graphs. The algorithm improves the previously known fastest algorithm by Italiano et al. in STOC’11 by a factor of logn. This speedup is obtained through the use of dense distance graphs combined with a divide-and-conquer approach. Extending this approach we are able to show an O(n 5/6 log5/2 n) time dynamic algorithm al well.

This work has been partially supported by the Polish Ministry of Science, Grant N N206 355636 and by the ERC StG Project PAAl no. 259515.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17, 209–223 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  2. Borradaile, G., Sankowski, P., Wulff-Nilsen, C.: Min st-cut oracle for planar graphs with near-linear preprocessing time. In: FOCS, pp. 601–610. IEEE Computer Society, Los Alamitos (2010)

    Google Scholar 

  3. Chalermsook, P., Fakcharoenphol, J., Nanongkai, D.: A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. In: Ian Munro, J. (ed.) SODA, pp. 828–829. SIAM, Philadelphia (2004)

    Google Scholar 

  4. Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. Journal of Graph Algorithms and Applications 3(3), 1–27 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fakcharoenphol, J., Rao, S.: Planar graphs, negative weight edges, shortest paths, and near linear time. J. Comput. Syst. Sci. 72(5), 868–889 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Frederickson, G.N.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput. 16(6), 1004–1022 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  7. Henzinger, M.R., Klein, P.N., Rao, S., Subramanian, S.: Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci. 55(1), 3–23 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lu, H.-I., Chang, H.-C.: Subquadratic algorithm for dynamic shortest distances. In: COCOON (to appear, 2011)

    Google Scholar 

  9. Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Comput. 7(4), 413–423 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  10. Italiano, G.F., Nussbaum, Y., Sankowski, P., Wulff-Nilsen, C.: Improved Min Cuts and Max Flows in Undirected Planar Graphs. In: STOC (2011)

    Google Scholar 

  11. Karger, D.R.: Minimum cuts in near-linear time. Journal of the ACM (JACM) 47(1), 46–76 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  12. Klein, P.N.: Multiple-source shortest paths in planar graphs. In: SODA, pp. 146–155. SIAM, Philadelphia (2005)

    Google Scholar 

  13. Nagamochi, H., Ibaraki, T.: Computing edge-connectivity in multiple and capacitated graphs. In: Asano, T., Imai, H., Ibaraki, T., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol. 450, pp. 12–20. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  14. Thorup, M.: Fully-dynamic min-cut. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, STOC 2001, pp. 224–230. ACM, New York (2001)

    Chapter  Google Scholar 

  15. Yuster, R., Zwick, U.: Finding even cycles even faster. SIAM J. Discrete Math. 10(2), 209–222 (1997)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Warsaw, Warsaw, Poland

    Jakub Łącki & Piotr Sankowski

Authors
  1. Jakub Łącki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Piotr Sankowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, University of Rome " La Sapienza", via Ariosto 25, 00185, Roma, Italy

    Camil Demetrescu

  2. School of Computer Science, Reykjavik University, Menntavegur 1, 101, Reykjavik, Iceland

    Magnús M. Halldórsson

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Łącki, J., Sankowski, P. (2011). Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time. In: Demetrescu, C., Halldórsson, M.M. (eds) Algorithms – ESA 2011. ESA 2011. Lecture Notes in Computer Science, vol 6942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23719-5_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23719-5_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23718-8

  • Online ISBN: 978-3-642-23719-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation