A linear-time algorithm for edge-disjoint paths in planar graphs

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 (n5/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.

[1]  Nobuji Saito,et al.  An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks , 1985, SIAM J. Comput..

[2]  S. Vajda,et al.  Integer Programming and Network Flows , 1970 .

[3]  Michael Kaufmann,et al.  A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs , 1991, ISA.

[4]  Nobuji Saito,et al.  A Linear-Time Routing Algorithm for Convex Grids , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  Robert E. Tarjan,et al.  A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets , 1979, J. Comput. Syst. Sci..

[6]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..

[7]  Michael Kaufmann.  A linear-time algorithm for routing in a convex grid , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Takao Nishizeki,et al.  Finding Steiner forests in planar graphs , 1990, SODA '90.

[9]  Haruko Okamura,et al.  Multicommodity flows in planar graphs , 1981, J. Comb. Theory, Ser. B.

[10]  Greg N. Frederickson,et al.  Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..

[11]  Refael Hassin,et al.  Maximum Flow in (s, t) Planar Networks , 1981, Inf. Process. Lett..

[12]  Karsten Weihe.  Multicommodity Flows in Even, Planar Networks , 1993, ISAAC.

[13]  Karsten Weihe,et al.  A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs , 1993, ESA.

[14]  Alon Itai,et al.  Maximum Flow in Planar Networks , 1979, SIAM J. Comput..

[15]  Kurt Mehlhorn,et al.  Routing Through a Generalized Switchbox , 1986, J. Algorithms.

[16]  Refael Hassin,et al.  On multicommodity flows in planar graphs , 1984, Networks.