Discrete Mathematics with Graph Theory (3rd Edition) 389

Discrete Mathematics with Graph Theory (3rd Edition) 389 -...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Section 14.2 387 c 8 t f 5,1 k We can see that this is maximum by examining the cut S = {s, a, b, c, d, e, g, j}, T = {I, h, i, k, t} which has capacity Ceh + Cbj + Cgi + Cjt = 3 + 2 + 5 + 3 = 13, the value of the flow. 2. The answers are given in the answers to Exercise 5 of Section 14.1 but, for convenience, we repeat them here. (a) [BB] We show a flow of value 6. To see that this is maximum, consider the cut S = {s,a,b}, T
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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

Ask a homework question - tutors are online