Sequential and parallel algorithms for minimum flows
- 1 March 2004
- journal article
- research article
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 15 (1-2) , 53-75
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Some Recent Advances in Network FlowsSIAM Review, 1991
- Processor-efficient implementation of a maximum flow algorithmInformation Processing Letters, 1991
- A Fast and Simple Algorithm for the Maximum Flow ProblemOperations Research, 1989
- Improved Time Bounds for the Maximum Flow ProblemSIAM Journal on Computing, 1989
- A parallel algorithm for finding a blocking flow in an acyclic networkInformation Processing Letters, 1989
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- An O(n2log n) parallel max-flow algorithmJournal of Algorithms, 1982