Min-Cuts and max-Flows Cuts: Partition of vertices into two sets Size of a Cut = Total Capacity Crossing the Cut Min -Cut: Minimum size of cuts 5 Max-Flows from s to t Min -Cut= Max-Flow 3 A 2 2 D 2 CMin-Cuts and Max-Flows • Cuts: Partition of vertices into two sets • Size of a Cut = Total Capacity Crossing the Cut • Min-Cut: Minimum size of Cuts = 5 • Max-Flows from S to T • Min-Cut = Max-Flow S A B D C T 3 3 3 3 2 2 2 S 4 A D 3 3 3 2 2 B C T 3 3 2 2 4 3 2 3 2 3 2 1 7