Tutorial11solution - Tutorial 11: Outline of Solutions Q1....

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: Tutorial 11: Outline of Solutions Q1. In the following two maximum flow problems with source s = 1 and sink t = 5, determine all s- t cuts. Find the minimum s- t cut in each case. Solution : (8,0) (4,0) (2,0) (6,0) (4,6) 2 4 5 3 (4,4) 1 30 25 15 20 12 2 3 5 4 18 22 12 1 (0,2) (4,0) u ji u ij i j (u ij, u ji ) i j i j For i < j u ij (a) Minimum s-t cut is S = { 1 } , S = { 2 , 3 , 4 , 5 } with capacity 37. S S ( S, S ) u ( S, S ) { 1 } { 2,3,4,5 } { (1 , 2) , (1 , 3) } 37 { 1,2 } { 3,4,5 } { (1 , 3) , (2 , 3) , (2 , 4) , (2 , 5) } 77 { 1,3 } { 2,4,5 } { (1 , 2) , (3 , 4) , (3 , 5) } 59 { 1,4 } { 2,3,5 } { (1 , 2) , (1 , 3) , (4 , 5) } 55 { 1,2,3 } { 4,5 } { (2 , 4) , (2 , 5) , (3 , 4) , (3 , 5) } 84 { 1,2,4 } { 3,5 } { (1 , 3) , (2 , 3) , (2 , 5) , (4 , 5) } 65 { 1,3,4 } { 2,5 } { (1 , 2) , (3 , 5) , (4 , 5) } 65 { 1,2,3,4 } { 5 } { (2 , 5) , (3 , 5) , (4 , 5) } 60 (b) Convert the graph into a directed graph and drop arcs with zero capacity. Minimum s-t cuts are S = { 1 } , S = { 2 , 3 , 4 , 5 } and S = { 1 , 3 } , S = { 2 , 4 , 5 } with capacity 10. 1 8 4 2 6 4 6 2 4 5 3 4 4 1 4 2 S S ( S, S ) u ( S, S ) { 1 } { 2,3,4,5 } { (1 , 2) , (1 , 3) , (1 , 4) } 10 { 1,2 } { 3,4,5 } { (1 , 4) , (1 , 3) , (2 , 3) , (2 , 5) } 20 { 1,3 } { 2,4,5 } { (1 , 2) , (1 , 4) , (3 , 5) } 10 { 1,4 } { 2,3,5 } { (1 , 2) , (1 , 3) , (4 , 3) , (4 , 5) } 14 { 1,2,3 } { 4,5 } { (1 , 4) , (2 , 5) , (3 , 5) } 12 { 1,2,4 } { 3,5 } { (1 , 3) , (2 , 3) , (2 , 5) , (4 , 3) , (4 , 5) } 24 { 1,3,4 } { 2,5 } { (1 , 2) , (3 , 5) , (4 , 5) } 12 { 1,2,3,4 } { 5 } { (2 , 5) , (3 , 5) , (4 , 5) } 14 Q2. Consider the maximum flow problem between source 1 and sink 4 in the network....
View Full Document

This note was uploaded on 12/02/2011 for the course MATH 3252 taught by Professor Tanbanpin during the Spring '10 term at National University of Singapore.

Page1 / 8

Tutorial11solution - Tutorial 11: Outline of Solutions Q1....

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