ESA 1994: Algorithms — ESA '94 pp 130-140 | Cite as

Edge-disjoint (s, t)-paths in undirected planar graphs in linear time

  • Karsten Weihe
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 855)

Abstract

We consider the following problem. Let G=(V, E) be an undirected planar graph and let s, t∈V, s≠t. The problem is to find a set of pairwise edge-disjoint paths, each connecting s with t, with maximum cardinality. In other words, the problem is to find a maximum unit flow from s to t. The fastest algorithm in the literature has running time O(|V|log|V|)(¦V¦ log ¦V¦). In this paper now, we give a linear time algorithm.

Keywords

Planar Graph Linear Time Unit Flow Outer Face Search Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AMO1]
    R.K. Ahuja, T.L. Magnanti and J.B. Orlin: Network Flows. In: G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd (eds.), Handbooks in Operations Research and Management Science 1. Elsevier Science Publishers, North-Holland, 1989.Google Scholar
  2. [AMO2]
    R.K. Ahuja, T.L. Magnanti und J.B. Orlin: Network Flows. Prentice Hall, 1993.Google Scholar
  3. [FF]
    L.R. Ford and D.R. Fulkerson (1962): Flows in networks. Princeton University Press.Google Scholar
  4. [Fr]
    G.N. Frederickson (1987): Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput. 16, 1004–1022.MATHMathSciNetGoogle Scholar
  5. [GT]
    Gabow and Tarjan (1985): A linear-time algorithm for a special case of disjoint set union. J. Comp. System Sci. 30, 209–221.MathSciNetGoogle Scholar
  6. [HJ]
    R. Hassin and D.B. Johnson (1985): An O(n log2 n) algorithm for maximum flow in undirected planar networks. SIAM J. Comput. 14, 612–624.CrossRefMathSciNetGoogle Scholar
  7. [HT]
    J. Hopcroft and R.E. Tarjan (1974): Efficient planarity testing. J. ACM 21, 549–568.CrossRefMathSciNetGoogle Scholar
  8. [Re]
    J.H. Reif (1983): Minimum s — t cut of a planar undirected network in O(log2(n)) time. SIAM J. Comput. 12, 71–81.CrossRefMATHMathSciNetGoogle Scholar
  9. [RWW]
    H. Ripphausen-Lipa, D. Wagner and K. Weihe (1992): The vertex-disjoint Menger problem in planar graphs. Proc. 4th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '93), 112–119.Google Scholar
  10. [WW]
    D. Wagner and K. Weihe (1992): A linear-time algorithm for edge-disjoint paths in planar graphs. Proc. 1st Europ. Symp. Algorithms (ESA '93), Lect. Notes Comp. Science 726, 384–395.MathSciNetGoogle Scholar
  11. [We]
    K. Weihe (1993): Multicommodity flows in even, planar networks. Proc. 4th Ann. Symp. Algorithms and Comp. (ISAAC '93), Lect. Notes Comp. Science 762, 333–342.MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Karsten Weihe
    • 1
  1. 1.Technische Universität BerlinBerlinGermany

Personalised recommendations