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

A faster algorithm for finding edge-disjoint branchings

โœ Scribed by Po Tong; E.L. Lawler

Book ID
103591592
Publisher
Elsevier Science
Year
1983
Weight
118 KB
Volume
1
Category
Article
ISSN
0167-7136

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

A Faster Algorithm for Finding the Minim
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
โœ J.X. Hao; J.B. Orlin ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 995 KB

We consider the problem of finding the minimum capacity cut in a directed network \(G\) with \(n\) nodes. This problem has applications to network reliability and survivability and is useful in subroutines for other network optimization problems. One can use a maximum flow problem to find a minimum