Question: 5. [15 marks] Assume that you are given a network flow graph G with a source s, a sink t and two other distinct vertices
5. [15 marks] Assume that you are given a network flow graph G with a source
s, a sink t and two other distinct vertices u and v. Design an algorithm which
returns a smallest capacity cut among all cuts for which the vertex u is in the
same side of the cut as the source s and vertex v is in the same side as the
sink t and which runs in polynomial time.
![5. [15 marks] Assume that you are given a network flow graph](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f3e5ecdbc94_14066f3e5ec64d3b.jpg)
5. [15 marks] Assume that you are given a network flow graph G with a source s, a sink t and two other distinct vertices u and v. Design an algorithm which returns a smallest capacity cut among all cuts for which the vertex u is in the same side of the cut as the source s and vertex v is in the same side as the sink t and which runs in polynomial time
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
