Brand et al ( Maximum Flow)
Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")
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