hw1_sol_long

hw1_sol_long - Com S 511: Homework #1 Due on Friday,...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Com S 511: Homework #1 Due on Friday, September 4, 2009 1 Com S 511 : Homework #1 Problem 1 Problem 1 Because the network has no infinite-capacity paths from s to t. So along each path from s to t, we could not send a finite among of flow, thus the maximum folw f * is finite. By (7.13), the capacity of min cut is equal to the value of the max flow. Let (A,B) denotes such cut and E c denotes the set of edges crossing from A to B. Then any edge crossing from A to B has finite capacity, which means E c E . Thus c ( A,B ) = e out of A c e e E c e . Let any cut (A, B) be any cut in the new network G. If 1) among the edges crossing from A to B, there exists an edge, which has infinite capacity in G, then c(A, B) M e E c e c(A, B); otherwise 2), the capacity of (A, B) remains unchanged and c(A, B) c(A,B). Therefore, (A, B) is still the min cut in G and thus the max flow is not affected....
View Full Document

This document was uploaded on 12/09/2010.

Page1 / 3

hw1_sol_long - Com S 511: Homework #1 Due on Friday,...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online