Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A quick method for finding shortest pairs of disjoint paths

A quick method for finding shortest pairs of disjoint paths 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Networks: An International Journal Wiley

A quick method for finding shortest pairs of disjoint paths

Loading next page...
 
/lp/wiley/a-quick-method-for-finding-shortest-pairs-of-disjoint-paths-3SqxOE91jf

References (8)

Publisher
Wiley
Copyright
Copyright © 1984 Wiley Periodicals, Inc., A Wiley Company
ISSN
0028-3045
eISSN
1097-0037
DOI
10.1002/net.3230140209
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Networks: An International JournalWiley

Published: Jun 1, 1984

There are no references for this article.