Question: How do you solve problems a, b, c,? I have solved b, but I want to check if it is correct. Thank you in advance

ManagementScience Name: MatriculationNumber: 7 Part 3 - Graph Theory (11 Points) (11P) Consider the directed graph with minimum are capacity 1,j, maximum are capacity Kij and starting flow xij. Note: For flows xij=0, no number is provided below are (i,j). a) Determine the minimum capacity 4,1 of are (4,1) such that the cut V4={q,1} and V4={s,2,3,4,5} has a capacity of 8 . Motivate your answer. (1P) 4.1=2? b) Set the minimum capacity for are (4,1) to 1,1=3 and determine the maximum flow with the algorithm of Ford and Fulkerson using the table below. (9P) ManagementScience Name: MatriculationNumber: 8 c) Determine the minimum cut by stating V4 and Vs. (1P)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
