Brand et al ( Maximum Flow)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O((E+V^{1.5})$log(U)polylog(V, E, log U))

Space Complexity

$O(E)$ words

((derived in notes))

Description

Approximate?

Exact

Randomized?

Yes,

Model of Computation

Word RAM

Year

2021

Reference

https://arxiv.org/abs/2101.05719

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Brand_et_al_(_Maximum_Flow)&oldid=45026"