Shiloach ( Maximum Flow)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(V^{3}*log(V)$/p)

Space Complexity

$O(E)$ words

(can be derived?)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Parallel RAM (unclear what type; seems like any could work?)

Year

1981

Reference

http://users.umiacs.umd.edu/~vishkin/TEACHING/4CLASS/SV82-maxflow.pdf