Algorithms for maximum network flow
- 1 January 1986
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Scaling algorithms for network problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- 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 Efficiency of the Algorithm “Capacity” for the Maximum Flow ProblemMathematics of Operations Research, 1980
- Computational Comparison of Eight Methods for the Maximum Network Flow ProblemACM Transactions on Mathematical Software, 1980
- Numerical investigations on the maximal flow algorithm of KarzanovComputing, 1979
- 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
- Algorithm 360: shortest-path forest with topological ordering [H]Communications of the ACM, 1969
- A note on two problems in connexion with graphsNumerische Mathematik, 1959