You want to increase the maximum flow of a network as much as possible, but you are

Question:

You want to increase the maximum flow of a network as much as possible, but you are only allowed to increase the capacity of one edge. 

a. How do you find such an edge? (Give pseudocode.) You may assume the existence of algorithms to compute max flow and min cut. What’s the running time of your algorithm? 

b. Is it always possible to find such an edge? Justify your answer.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Algorithm Design And Applications

ISBN: 9781118335918

1st Edition

Authors: Michael T. Goodrich, Roberto Tamassia

Question Posted: