Flow Switching Approach to the Maximum Flow Problem: I
- 1 October 1977
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 24 (4) , 630-645
- https://doi.org/10.1145/322033.322042
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- More pathological examples for network flow problemsMathematical Programming, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal FlowsJournal of the ACM, 1972
- Linear Programming and ExtensionsPublished by Rand Corporation ,1963