Question: 1. Let G be a directed graph with source vertex s and sink vertex t, and assume that all edge capacities are nonnegative integers. Let

1. Let G be a directed graph with source vertex s and sink vertex t, and assume that all edge capacities are nonnegative integers. Let G^0 be the network obtained by reducing the capacity of exactly one, arbitrary edge, say e ^? , by x.

Prove that: maxflow(G^0 ) ? maxflow(G) ? x .

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 Databases Questions!