Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Tarjan (1983)
Data structures and network algorithms, 44
S. Fortune, J. Hopcroft, J. Wyllie (1978)
The Directed Subgraph Homeomorphism ProblemTheor. Comput. Sci., 10
Donald Johnson (1975)
Priority Queues with Update and Finding Minimum Spanning TreesInf. Process. Lett., 4
J. Suurballe (1974)
Disjoint paths in a networkNetworks, 4
E. Dijkstra (1959)
A note on two problems in connexion with graphsNumerische Mathematik, 1
R. Tarjan (1974)
Finding Dominators in Directed GraphsSIAM J. Comput., 3
A. Aho, J. Hopcroft, J. Ullman (1974)
The Design and Analysis of Computer Algorithms
Donald Johnson (1977)
Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM (JACM), 24
Let G be a directed graph containing n vertices, one of which is a distinguished source s, and m edges, each with a non‐negative cost. We consider the problem of finding, for each possible sink vertex v, a pair of edge‐disjoint paths from s to v of minimum total edge cost. Suurballe has given an O(n2 logn)‐time algorithm for this problem. We give an implementation of Suurballe's algorithm that runs in O(m log(1+ m/n)n) time and O(m) space. Our algorithm builds an implicit representation of the n pairs of paths; given this representation, the time necessary to explicitly construct the pair of paths for any given sink is O(1) per edge on the paths.
Networks: An International Journal – Wiley
Published: Jun 1, 1984
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.