An O(EVIog2V) algorithm for the maximal flow problem
- 1 October 1980
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 21 (2), 203-217
- https://doi.org/10.1016/0022-0000(80)90035-5
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Maximum Flow in Planar NetworksSIAM Journal on Computing, 1979
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956