Madry ( Maximum Flow)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(E^({10}/{7})$U^({1}/{7})polylog(V, E, log U))

Space Complexity

$O(E)$ words

((derived in notes))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2016

Reference

https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/stamp/stamp.jsp?tp=&arnumber=7782974