An O(V 5/3 E 2/3) algorithm for the maximal flow problem
- 1 September 1980
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 14 (3) , 221-242
- https://doi.org/10.1007/bf00264254
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Network flow and generalized path compressionPublished by Association for Computing Machinery (ACM) ,1979
- An O(|V|3) algorithm for finding maximum flows in networksInformation Processing Letters, 1978