Gao, Liu, Peng ( Maximum Flow)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(E^({3}/{2}-{1}/{328})$*log(U)*polylog(E))

Space Complexity

$O(E)$ words

((derived in notes))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2021

Reference

https://arxiv.org/abs/2101.07233