A new algorithm for the maximal flow problem
- 1 October 1978
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 231-245
- https://doi.org/10.1109/sfcs.1978.5
Abstract
A new algorithm for finding the maximal flow in a given network is presented. The algorithm runs in time O(V5/3E2/3) or O(n2.33) where n = V + E is the length of the input.Keywords
This publication has 2 references indexed in Scilit:
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- A note on the maximum flow through a networkIEEE Transactions on Information Theory, 1956