Abstract
Given a graph G = (V, E) and two vertices s, t ∈ V, s ≠ t, the Menger problem is to find a maximum number of disjoint paths connecting s and t. Depending on whether the input graph is directed or not, and what kind of disjointness criterion is demanded, this general formulation is specialized to the directed or undirected vertex, and the edge or arc disjoint Menger problem, respectively.
For planar graphs the edge disjoint Menger problem has been solved to optimality [Wei97], while the fastest algorithm for the arc disjoint version is Weihe's general maximum flow algorithm for planar networks [Wei94], which has running time O(|V| log |V|). Here we present a linear time, i.e. asymptotically optimal, algorithm for the arc disjoint version in planar directed graphs.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network flows. Prentice Hall, 1993.
Ulrik Brandes and Dorothea Wagner. A linear time algorithm for the arc disjoint Menger problem in planar directed graphs. Konstanzer Schriften in Mathematik und Informatik 29, Universität Konstanz, 1997.
Harold N. Gabow and Robert E. Tarjan. A linear-time algorithm for a special case of disjoint set union. J. of Computer and System Sciences, 30:209–221, 1985.
John E. Hopcroft and Robert E. Tarjan. Efficient planarity testing. J. of the Association for Computing Machinery, 21:549–568, 1974.
Alon Itai and Yossi Shiloach. Maximum flows in planar networks. SIAM J. Comput., 8:135–150, 1979.
David S. Johnson and S.M. Venkatesan. Using divide and conquer to find flows in directed planar networks in O(n3/2log n) time. In Proceedings 20th Ann. Allerton Conf. Comm., Control, and Comp., pages 898–905, 1982.
Samir Khuller, Joseph (Seffi) Naor, and Philip Klein. The lattice structure of flow in planar graphs. SIAM J. Discrete Math., 6(3):477–490, 1993.
Philip Klein, Satish B. Rao, Monika Rauch-Henzinger, and S. Subramanian. Faster shortest-path algorithms for planar graphs. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94, pages 27–37, 1994.
Karl Menger. Zur allgemeinen Kurventheorie. Fund. Math., 10:95–115, 1927.
Heike Ripphausen-Lipa, Dorothea Wagner, and Karsten Weihe. Efficient algorithms for disjoint paths in planar graphs. In William Cook, Laszlo Lovâsz, and Paul Seymour, editors, DIMACS Series in Discrete Mathematics and Computer Science, volume 20, pages 295–354. American Mathematical Society, 1995.
Heike Ripphausen-Lipa, Dorothea Wagner, and Karsten Weihe. The vertex-disjoint Menger problem in planar graphs. SIAM J. Comput., 1997. to appear.
Karsten Weihe. Maximum (s, t)-flows in planar network in O(n log n) time. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, FOCS'94, pages 178–189, 1994.
Karsten Weihe. Edge-disjoint (s, t)-paths in undirected planar graphs in linear time. J. of Algorithms, 23:121–138, 1997.
Dorothea Wagner and Karsten Weihe. A linear time algorithm for edgedisjoint paths in planar graphs. Combinatorica, 15:135–150, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brandes, U., Wagner, D. (1997). a linear time algorithm for the arc disjoint Menger problem in planar directed graphs. In: Burkard, R., Woeginger, G. (eds) Algorithms — ESA '97. ESA 1997. Lecture Notes in Computer Science, vol 1284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63397-9_6
Download citation
DOI: https://doi.org/10.1007/3-540-63397-9_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63397-6
Online ISBN: 978-3-540-69536-3
eBook Packages: Springer Book Archive