A new approach to the maximum-flow problem
- 1 October 1988
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 35 (4), 921-940
- https://doi.org/10.1145/48014.61051
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Integer Optimization and Zero-Temperature Fixed Point in Ising Random-Field SystemsPhysical Review Letters, 1986
- Scaling algorithms for network problemsJournal of Computer and System Sciences, 1985
- Complexity of network synchronizationJournal of the ACM, 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
- Minimum cuts and related problemsNetworks, 1975
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956