Abstract
In this paper we discuss the problem of finding edge-disjoint paths in a planar, undirected graph such that each path connects two specified vertices on the boundary of the graph. We will focus on the “classical” case where an instance additionally fulfills the so-calledevenness-condition. The fastest algorithm for this problem known from the literature requiresO (n 5/3(loglogn)1/3) time, wheren denotes the number of vertices. In this paper now, we introduce a new approach to this problem, which results in anO(n) algorithm. The proof of correctness immediately yields an alternative proof of the Theorem of Okamura and Seymour, which states a necessary and sufficient condition for solvability.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Becker, andK. Mehlhorn: Algorithms for routing in planar graphs,Acta Inform. 23 (1986), 163–176.
G. N. Frederickson: Fast algorithms for shortest paths in planar graphs with applications,SIAM J. Comput.,16 (1987), 1004–1022.
H. N. Gabow andR. E. Tarjan: A linear-time algorithm for a special case of disjoint set union.J. Comput. System Sci.,30 (1985), 209–221.
R. Hassin: Maximum flows in (s,t) planar networks,Inform. Process. Lett. 13 (1981), 107.
R. Hassin: On multicommodity flows in planar graphs,Networks,14 (1984), 225–235.
T. C. Hu:Integer programming and network flows, Addison-Wesley, Reading, MA, 1969.
A. Itai, andY. Shiloach Maximum flows in planar networks,SIAM J. Comput.,8 (1979), 135–150.
M. Kaufmann: A linear time algorithm for routing in a convex grid.IEEE Trans. Comp.-Aided Design, CAD-9, 180–184, 1990.
M. Kaufmann, andG. Klär: A faster algorithm for edge-disjoint paths in planar graphs, In W. L. Hsu and R. C. T. Lee, editors,ISA'91 Algorithms, Second International Symposium on Algorithms, pages 336–348. Springer-Verlag, Lecture Notes in Computer Science, vol. 557, 1991.
M. Kaufmann andK. Mehlhorn: Generalized switchbox routing,J. Algorithms,7 (1985), 510–531.
P. Klein, S. Rao, M. Rauch, andS. Subramanian: Faster shortest-path algorithms for planar graphs, Proceedings ofSTOC'94.
K. Matsumoto, T. Nishizeki, andN. Saito: An efficient algorithm for finding multicommodity flows in planar networks.SIAM J. Comput.,14 289–302, 1985.
T. Nishizeki, N. Saito, andK. Suzuki: A linear time routing algorithm for convex grids,IEEE Trans. Comp.-Aided Design, CAD-4:68–76, 1985.
H. Okamura, andP. D. Seymour: Multicommodity flows in planar graphs.J. Combin. Theory Ser. B,31 (1981), 75–81.
H. Suzuki, T. Akama, andT. Nishizeki: Finding Steiner forests in planar graphs. InProceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'90, pages 444–453, 1990.
R. E. Tarjan: A class of algorithms which require non-linear time to maintain disjoint sets.J. Comp. System Sciences,18 (1979), 110–127.
K. Weihe: Multicommodity flows in even, planar networks, In K. W. Ng, P. Raghavan, N. V. Balasubramanian, and F. Y. L. Chin, editors,Algorithms and Computation, 4th International Symposium, ISAAC'93, pages 333–342. Springer-Verlag, Lecture Notes in Computer Science, vol 762, 1993.
D. Wagner, andK. Weihe: A linear time algorithm for edge-disjoint paths in planar graphs, In T. Lengauer, editor,First European Symposium on Algorithms, ESA'93, pages 384–395. Springer-Verlag, Lecture Notes in Computer Science, vol. 726, 1993.
Author information
Authors and Affiliations
Additional information
The authors acknowledge theDeutsche Forschungsgemeinschaft for supporting this research under grantMö 446/1-3