Question: Suppose that D = (V, A: c) is a flow network and f is a maximum s-t flow in D. Let U be a
Suppose that D = (V, A: c) is a flow network and f is a maximum s-t flow in D. Let U be a subset of V with sEUCV\{t}. Prove that sout (U) is a minimum s-t cut in D if and only if residual graph Df has no edge from U to V\U.
Step by Step Solution
3.43 Rating (143 Votes )
There are 3 Steps involved in it
Solution Suppose that D V A c is a flow network and f is maximum sit flow in ... View full answer
Get step-by-step solutions from verified subject matter experts
