Cherkassky ( Maximum Flow)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(V^{2}E^{0.5})$

Space Complexity

$O(E)$ words

(https://core.ac.uk/download/pdf/81946904.pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1977

Reference

https://www.sciencedirect.com/science/article/abs/pii/S037722179600269X