Question: Show that in a network G with capacities all equal to 1, the capacity of a minimum cut set (S, T) equals the minimum number

Show that in a network G with capacities all equal to 1, the capacity of a minimum cut set (S, T) equals the minimum number q of edges whose deletion destroys all directed paths s ? t. (A directed path v ? w is a path in which each edge has the direction in which it is traversed in going from v to w.)4 5 6 3 3 4 5 7 5 3 6 8

4 5 6 3 3 4 5 7 5 3 6 8 4 (8) to

Step by Step Solution

3.34 Rating (163 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Since S T is a cut set there is no directed path st in G with the e... View full answer

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

Document Format (1 attachment)

Word file Icon

1-M-O-G-G-O (14).docx

120 KBs Word File

Students Have Also Explored These Related Optimization Questions!