Title :
A new algorithm for the maximal flow problem
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 :
Complexity theory; Computer science; History; Integral equations; Law; Legal factors; Mathematics;
Conference_Titel :
Foundations of Computer Science, 1978., 19th Annual Symposium on
Conference_Location :
Ann Arbor, MI, USA
DOI :
10.1109/SFCS.1978.5
