๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A quick method for finding shortest pairs of disjoint paths

โœ Scribed by J. W. Suurballe; R. E. Tarjan

Publisher
John Wiley and Sons
Year
1984
Tongue
English
Weight
630 KB
Volume
14
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Parallel Algorithm for Shortest Pairs of
Parallel Algorithm for Shortest Pairs of Edge-Disjoint Paths
โœ S. Banerjee; R.K. Ghosh; A.P.K. Reddy ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 241 KB

method a solution for MSP can be found within the same time bound. The problem of finding all pairs of shortest paths in a directed graph with nonnegative edge weights can be solved in O(log 2 n) time using n 3 /log n processors on a CREW PRAM [7]. Therefore, SSP can be solved within the same resou

Heuristics for finding a maximum number
Heuristics for finding a maximum number of disjoint bounded paths
โœ D. Ronen; Y. Perl ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 684 KB

We consider the following problem: Given an integer k and a network G with two distinct vertices s and t , find a maximum number of vertex disjoint paths from s to t of length bounded by k. In a recent work [ 91 it was shown that for length greater than four this problem is NP-hard. In this paper we