Maximum Flow in Directed Planar Graphs with Vertex Capacities

  • Haim Kaplan
  • Yahav Nussbaum
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5757)

Abstract

In this paper we present an O(nlogn) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the arcs. If the source and the sink are on the same face, then our algorithm can be implemented in O(n) time.

For general (not planar) graphs, vertex capacities do not make the maximum flow problem more difficult, as there is a simple reduction that eliminates vertex capacities. However, this reduction does not preserve the planarity of the graph. The essence of our algorithm is a different reduction that does preserve the planarity, and can be implemented in linear time. For the special case of undirected planar graph, an algorithm with the same time complexity was recently claimed, but we show that it has a flaw.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, New Jersey (1993)MATHGoogle Scholar
  2. 2.
    Borradaile, G., Klein, P.: An O(n logn) algorithm for maximum st-flow in a directed planar graph. J. ACM 56 (2009)Google Scholar
  3. 3.
    Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, New Jersey (1962)MATHGoogle Scholar
  4. 4.
    Hassin, R.: Maximum flow in (s, t) planar networks. Information Processing Letters 13, 107 (1981)CrossRefGoogle Scholar
  5. 5.
    Henzinger, M.R., Klein, P., Rao, S., Subramania, S.: Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci. 55, 3–23 (1997)CrossRefMATHGoogle Scholar
  6. 6.
    Johnson, D.B.: Parallel algorithms for minimum cuts and maximum flows in planar networks. J. ACM 34, 950–967 (1987)CrossRefGoogle Scholar
  7. 7.
    Khuller, S., Naor, J.: Flow in planar graphs with vertex capacities. Algorithmica 11, 200–225 (1994)CrossRefMATHGoogle Scholar
  8. 8.
    Khuller, S., Naor, J., Klein, P.: The lattice structure of flow in planar graphs. SIAM J. Disc. Math. 63, 477–490 (1993)CrossRefMATHGoogle Scholar
  9. 9.
    Nishizwki, T., Chiba, N.: Planar Graphs: Theory and Algorithms. Ann. Discrete Math, vol. 32. North-Holland, Amsterdam (1988)Google Scholar
  10. 10.
    Ripphausen-Lipa, H., Wagner, D., Weihe, K.: The vertex-disjoint Menger problem in planar graphs. SIAM J. Comput. 26, 331–349 (1997)CrossRefMATHGoogle Scholar
  11. 11.
    Weihe, K.: Maximum (s, t)-flows in planar networks in O(|V|log|V|)-time. J. Comput. Syst. Sci. 55, 454–476 (1997)CrossRefMATHGoogle Scholar
  12. 12.
    Zhang, X., Liang, W., Jiang, H.: Flow equivalent trees in node-edge-capacitated undirected planar graphs. Information Processing Letters 100, 100–115 (2006)CrossRefMATHGoogle Scholar
  13. 13.
    Zhang, X., Liang, W., Chen, G.: Computing maximum flows in undirected planar networks with both edge and vertex capacities. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 577–586. Springer, Heidelberg (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Haim Kaplan
    • 1
  • Yahav Nussbaum
    • 1
  1. 1.The Blavatnik School of Computer ScienceTel Aviv UniversityTel AvivIsrael

Personalised recommendations