Regular ArticleEdge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time☆,☆☆
References (19)
- et al.
A linear-time algorithm for a special case of disjoint set union
J. Comput. Syst. Sci.
(1985) - et al.
Network flows
Handbooks in Operations Research and Management Science
(1989) - et al.
Network flows
(1993) - et al.
Flows in networks
(1962) Fast algorithms for shortest paths in planar graphs with applications
SIAM J. Comput.
(1987)Maximum flows in (st
Inform. Process. Lett.
(1981)- et al.
An (n2n
SIAM J. Comput.
(1985) - et al.
Efficient planarity testing
J. Assoc. Comput. Mach.
(1974) - et al.
Maximum flows in planar networks
SIAM J. Comput.
(1979)
There are more references available in the full text version of this article.
Cited by (19)
Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n<sup>1+ε</sup>) time
2011, Theoretical Computer ScienceEfficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids
2000, Journal of AlgorithmsMaximum (s, t) - Flows in Planar Networks in script O sign (\V\ log \V\) Time
1997, Journal of Computer and System SciencesHoliest minimum-Cost paths and flows in surface graphs
2018, Proceedings of the Annual ACM Symposium on Theory of Computing
- ☆
This work was supported by the Technische Universität Berlin under Grant FIP 1/3 and by the Deutsche Forschungsgemeinschaft under Grant Wa 654/10-2. A preliminary version has been published under the same title in “Proceedings of the Second European Symposium on Algorithms (ESA '94),” Springer Lecture Notes in Computer Science, Vol. 855, pp. 130–140.
- ☆☆
George, L. NemhauserA. H. G. Rinnooy KanM. J. Todd, Eds.
- †
E-mail: [email protected].
Copyright © 1997 Academic Press. All rights reserved.