Question: Let f be a maximum flow on a network G from vertex s to vertex t, and let (L,R) be a minimum capacity st-cut in
Let f be a maximum flow on a network G from vertex s to vertex t, and let (L,R) be a minimum capacity st-cut in G. True or false: every edge e with endpoints on different sides of (L,R) satisfies fe=ce, where ce is the capacity of edge e
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
