Abstract
An efficient algorithm for the edge-disjoint paths problem in planar graphs is presented. Using Frederickson's [F84] decomposition method for planar graphs we improve the best bound for the running time of O(n 2) [BM86, MNS86] for the edgedisjoint paths problem to O(n 5/3(log log n)1/3).
This work was supported by the Deutsche Forschungsgemeinschaft, SFB 124, VLSI-Entwurfsmethoden und Parallelität.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Becker, K. Mehlhorn: “Algorithms for Routing in Planar Graphs”, Acta Informatica 23 (1986), pp. 163–176.
S.Even, Altai, A.Shamir: “On the complexity of timetable and multicommodity flow problems”, SIAM J. Comp. 5(4) (1976), pp. 691–703.
P. Van Emde Boas, R. Kaas, and E. Zijlstra: “Design and implementation of an efficient priority queue”, Math. Sys. Theory 10 (1977), pp. 99–127.
A. Frank: “Disjoint Paths in Rectilinear Grids”, Combinatorica 2, 4 (1982), pp. 361–371.
G. N. Frederickson: “Fast Algorithms For Shortest Paths In Planar Graphs, With Applications”, Technical report (1984), Purdue University, Indiana.
L.R. Ford, D.R. Fulkerson: “Maximal flow through a network”, Canadian Journal of Mathematics, Vol. 8, pp. 399–404 (1956).
M.Kaufmann: “A linear-time algorithm for routing in a convex grid”, IEEE Trans. on Computer-Aided Design 2 (1990), pp. 180–184.
M. Kaufmann, K. Mehlhorn: “Routing through a Generalized Switchbox”, J. Algorithms 7, pp. 510–531 (1986).
K. Matsumoto, T. Nishizeki, N. Saito: “An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks”, SIAM Journal of Computing, Vol 15:2 (1986), pp. 495–510.
K. Mehlhorn, F.P. Preparata, M. Sarrafzadeh: “Channel routing in knockknee mode: Simplified algorithms and proofs”, Algorithmica 1 (1986), pp. 213–221.
T. Nishizeki, N. Saito, K. Suzuki: “A linear-time routing algorithm for convex grids”, IEEE Trans. on Computer Aided Design, CAD-4 (1985), pp. 68–76.
H. Okamura: “Multicommodity Flows in Graphs”, Discrete Applied Mathematics 6 (1983), pp. 55–62.
H. Okamura, P.D. Seymour: “Multicommodity Flows in Planar Graphs”, Journal of Combinatorial Theory 31, Series B (1981), pp. 75–81.
A. Schrijver: “Decomposition of graphs on surfaces and a homotopic circulation theorem”, tech. report (1987), to appear in J. Comb. Theory, Ser. B.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaufmann, M., Klär, G. (1991). A faster algorithm for edge-disjoint paths in planar graphs. In: Hsu, WL., Lee, R.C.T. (eds) ISA'91 Algorithms. ISA 1991. Lecture Notes in Computer Science, vol 557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54945-5_78
Download citation
DOI: https://doi.org/10.1007/3-540-54945-5_78
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54945-1
Online ISBN: 978-3-540-46600-0
eBook Packages: Springer Book Archive