Mincut. Cs 161 lecture 16 min cut and karger s algorithm scribes. In computer science and optimization theory the max flow min cut theorem states that in a flow network the maximum amount of flow passing from the source to the sink is equal to the total weight of the edges in a minimum cut i e.
Minimum st cut mincut problem. Find minimum residual capacity of the edges along the. Using the current best max flow algorithms this results in an overall running time of o m min p m n2 3 for weighted graphs and m4 3 o 1 for unweighted multi graphs.
The smallest total weight of the edges which if removed would disconnect the source from the sink.
November 28 2016 anthony kim 2016 1 minimum cut problem. In graph theory a minimum cut or min cut of a graph is a cut a partition of the vertices of a graph into two disjoint subsets that is minimal in some sense. Cs 161 lecture 16 min cut and karger s algorithm scribes. The minimum cut problem or mincut problem is to nd a cut of minimum cost.
