Unformatted text preview: = {c,d,e,!,t}. (b) We show a flow of value 5. To see that this is maximum, consider the cut S = {s,a,b,c,d,e,f}, T = it}. (c) We show a maximum of value 9. To see that this is maximum, consider the cut S = is, a}, T = {b,c,d, e, I, t}. (d) We show a maximum of value 10. To see that the flow is maximum, consider the cut S = {s,a,b,c,d,e}, T = it}. 8 a 8 C3E+~ c 8 a 3,3 d 1,0 1,1 t 2,0 1,1 c 2,2 f t t d t e...
View
Full
Document
This note was uploaded on 11/08/2010 for the course MATH discrete m taught by Professor Any during the Summer '10 term at FSU.
 Summer '10
 any
 Graph Theory

Click to edit the document details