1. Let G be a directed graph with source vertex s and sinkvertex t, and assume that all edge capacities are nonnegativeintegers. Let G^0 be the network obtained by reducing the capacityof exactly one, arbitrary edge, say e ^? , by x.
Prove that: maxflow(G^0 ) ? maxflow(G) ? x .
Expert Answer
An answer will be send to you shortly. . . . .