Question: 2 3. Consider the graph below for a maximum flow problem from 1 to 7. The capacities are indicated on the edges: 3 5 9

2 3. Consider the graph below for a maximum flow

2 3. Consider the graph below for a maximum flow problem from 1 to 7. The capacities are indicated on the edges: 3 5 9 8 4 7 7 1 4 5 4 6 3 4 5 2 6 (a) Find a feasible flow from 1 to 7 so that the edges (2,5), (4,5), (6,5) and (6,7) are saturated. (b) By using part (a), find a number a, a feasible flow from 1 to 7 with value a, and a 1-7 cut with capacity a. (c) State why the feasible flow in (a) is maximal and the cut in (b) is minimal

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!