The maximum flow problem: A max-preflow approach
- 15 August 1991
- journal article
- review article
- Published by Elsevier in European Journal of Operational Research
- Vol. 53 (3), 257-278
- https://doi.org/10.1016/0377-2217(91)90060-9
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Analysis of Preflow Push Algorithms for Maximum Network FlowSIAM Journal on Computing, 1989
- 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 new approach to the maximum-flow problemJournal of the ACM, 1988
- Dual coordinate step methods for linear network flow problemsMathematical Programming, 1988
- Scaling algorithms for network problemsJournal of Computer and System Sciences, 1985
- An O(EVIog2V) algorithm for the maximal flow problemJournal of Computer and System Sciences, 1980
- An O(V 5/3 E 2/3) algorithm for the maximal flow problemActa Informatica, 1980
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Computation of maximal flows in networksNaval Research Logistics Quarterly, 1955