Kathuria, Liu, Sidford ( Maximum Flow)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(E^({4}/{3}+o({1})$)U^({1}/{3}))

Space Complexity

$O(E)$ or $O(V^{2})$ ? words

(unsure, please look)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2020

Reference

https://epubs.siam.org/doi/abs/10.1137/20M1383525