Improved Time Bounds for the Maximum Flow Problem
- 1 October 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (5) , 939-954
- https://doi.org/10.1137/0218065
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Finding minimum-cost flows by double scalingMathematical Programming, 1992
- Finding Minimum-Cost Circulations by Successive ApproximationMathematics of Operations Research, 1990
- A Fast and Simple Algorithm for the Maximum Flow ProblemOperations Research, 1989
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- Scaling algorithms for network problemsJournal of Computer and System Sciences, 1985
- Self-adjusting binary search treesJournal of the ACM, 1985
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- An O(n2log n) parallel max-flow algorithmJournal of Algorithms, 1982
- An O(|V|3) algorithm for finding maximum flows in networksInformation Processing Letters, 1978
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972