A new algorithm for the maximal flow problem

Authors:
Zvi Galil
Affiliations:
-
Venue:
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Year:
1978

Citing 0
Cited 1

A new Karzanov-type O(n3) max-flow algorithm

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.