Min-cut

cosmos 18th January 2018 at 6:21pm
Graph algorithms

There are O(n3)O(n^3) deterministic algorithm, and O(n2log3n)O(n^2 \log^3 n) Randomized algorithm

See here it's quite nice

See also Max-flow min-cut theorem