An O(|V|3) algorithm for finding maximum flows in networks
- 31 October 1978
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 7 (6), 277-278
- https://doi.org/10.1016/0020-0190(78)90016-9
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975