Skip to main content
SpringerLink
Log in

Maximum st-Flow in Directed Planar Graphs via Shortest Paths

  • Conference paper
Combinatorial Algorithms (IWOCA 2013)

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

Included in the following conference series:

Abstract

In this paper, we give a correspondence between maximum flows and shortest paths via duality in directed planar graphs with no constraints on the source and sink.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Borradaile, G.: Exploiting Planarity for Network Flow and Connectivity Problems. PhD thesis, Brown University (2008)

    Google Scholar 

  2. Borradaile, G., Harutyunyan, A.: Maximum st-flow in directed planar graphs via shortest paths. Technical report, arXiv:1305.5823 (2013)

    Google Scholar 

  3. Borradaile, G., Harutyunyan, A.: Boundary-to-boundary flows in planar graphs. In: Lecroq, T., Mouchard, L. (eds.) IWOCA 2013. LNCS, vol. 8288, Springer, Heidelberg (2013)

    Google Scholar 

  4. Borradaile, G., Klein, P.: An O(n logn) algorithm for maximum st-flow in a directed planar graph. J. of the ACM 56(2), 1–30 (2009)

    Article  MathSciNet  Google Scholar 

  5. Erickson, J.: Maximum flows and parametric shortest paths in planar graphs. In: Proc. SODA, pp. 794–804 (2010)

    Google Scholar 

  6. Ford, C., Fulkerson, D.: Maximal flow through a network. Canadian J. Math. 8, 399–404 (1956)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hassin, R.: Maximum flow in (s,t) planar networks. IPL 13, 107 (1981)

    Article  MathSciNet  Google Scholar 

  8. Hochbaum, D.: The pseudoflow algorithm: A new algorithm for the maximum-flow problem. Operations Research 56(4), 992–1009 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Johnson, D., Venkatesan, S.: Partition of planar flow networks. In: Proc. SFCS, pp. 259–264 (1983)

    Google Scholar 

  10. Kaplan, H., Nussbaum, Y.: Minimum st-cut in undirected planar graphs when the source and the sink are close. In: Proc. STACS, pp. 117–128 (2011)

    Google Scholar 

  11. Sleator, D., Tarjan, R.: A data structure for dynamic trees. JCSS 26(3), 362–391 (1983)

    MathSciNet  MATH  Google Scholar 

  12. Spanier, E.: Algebraic Topology. Springer (1994)

    Google Scholar 

  13. Tarjan, R., Werneck, R.: Dynamic trees in practice. J. Exp. Algorithmics 14, 5:4.5–5:4.23 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Oregon State University, USA

    Glencora Borradaile

  2. Vrije Universiteit Brussel, Belgium

    Anna Harutyunyan

Authors
  1. Glencora Borradaile
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anna Harutyunyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. UFR des Sciences et Techniques, LITIS, Université de Rouen, 76821, EA 4180, Mont Saint Aignan Cedex, France

    Thierry Lecroq  & Laurent Mouchard  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Borradaile, G., Harutyunyan, A. (2013). Maximum st-Flow in Directed Planar Graphs via Shortest Paths. In: Lecroq, T., Mouchard, L. (eds) Combinatorial Algorithms. IWOCA 2013. Lecture Notes in Computer Science, vol 8288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45278-9_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45278-9_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45277-2

  • Online ISBN: 978-3-642-45278-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation