This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Assignment #6, CS4/531 Due Date: Friday. Dec. 9, 2011 Total points: 52 • You MUST turn in your HW by 2:10pm on Dec 9. After that, I will NOT accept your HW. This rule will be STRICTLY ENFORCED. • Please PRINT YOUR LAST NAME, FIRST NAME and UB number on the first page. • Write solution of each problem on a separate sheet. Staple them in the order of problem numbers. • If your homework solution deviates significantly from these guidelines, TA may deduct up to 20% of the points. 1. (4 points) Describe if the following statement is true or false. If it is true, give a short explanation. If it’s false, give a counter example. Let G be a (basic) flownetwork with source s and sink t . Each directed edge e of G has a positive integer capacity c ( e ). If f is a maxflow of G , then f saturates every edge out of s . (Namely, for every edge e = s → v , f ( e ) = c ( e ).) 2. (4 points) Describe if the following statement is true or false. If it is true, give a short explanation. If it’s false, give a counter example. Let G be a (basic) flownetwork with source s and sink t . Each directed edge e of G has a positive integer capacity c ( e ). Let ( S,T ) be a minimum capacity stcut with respect to the capacity function c ( * ). Now suppose that we add 1 to the capacity of every edge e . Namely, we define a new capacity function c ′ ( e ) = c ( e ) + 1 for every edge e in G . Then ( S,T...
View
Full
Document
This note was uploaded on 02/27/2012 for the course CSE 431/531 taught by Professor Xinhe during the Fall '11 term at SUNY Buffalo.
 Fall '11
 XINHE
 Algorithms

Click to edit the document details