Ahuja et al. ( Maximum Flow)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(VELog(V(LogU)$^{0.5} / E))

Space Complexity

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1987

Reference

http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.86.5093&rep=rep1&type=pdf