Karzanov ( Maximum Flow)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(V^{3})$

Space Complexity

$O(V^{2})$ words

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

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1974

Reference

http://alexander-karzanov.net/Publications/maxflow-acyc.pdf