Parallel algorithm for finding a blocking flow in an acyclic network
Technical Report
·
OSTI ID:7083935
We suppose a simple parallel algorithm for finding a blocking flow in an acyclic network. On an n-vertex, m-arc network, our algorithm runs in O(n log n) time and O(nm) space using an m-processor EREW PRAM. A consequence of our algorithm is an O(n2(log n)log(nC))-time, O(nm)-space, m-processor algorithm for the minimum-cost circulation problem, on a network with integer arc capacities of magnitude at most C.
- Research Organization:
- Princeton Univ., NJ (USA). Dept. of Computer Science
- OSTI ID:
- 7083935
- Report Number(s):
- AD-A-215113/2/XAB; CS-TR--186-88
- Country of Publication:
- United States
- Language:
- English
Similar Records
A parallel algorithm for finding a blocking flow in an acyclic network
High-probability parallel transitive-closure algorithms
Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems
Book
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:6274771
High-probability parallel transitive-closure algorithms
Journal Article
·
Thu Jan 31 23:00:00 EST 1991
· SIAM Journal on Computing (Society for Industrial and Applied Mathematics); (United States)
·
OSTI ID:5926155
Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:416828