DocumentCode
2179636
Title
A new algorithm for the maximal flow problem
Author
Galil, Zvi
fYear
1978
fDate
16-18 Oct. 1978
Firstpage
231
Lastpage
245
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1978., 19th Annual Symposium on
Conference_Location
Ann Arbor, MI, USA
ISSN
0272-5428
Type
conf
DOI
10.1109/SFCS.1978.5
Filename
4567983
Link To Document