Determine also the minimum cut 1 u 2 4 u d d 0

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

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

Unformatted text preview: minimum cut. 1 u [2, 4] u d d  [0, 4] d T d d ‚ [1, 3] d w v E u d d  [1, 3] d [0, 3] T d d ‚ d du [−1, 1] dus d d [1, 3] d d   d d [0, 4] d [1, 2] d [1, 5] ‚ d ‚ d d d du E du u r [1, 3] [−1, 1] x y 4. Given the digraph below with source r and sink s. The two values between brackets given at each arc give the demand and the capacity of that arc. Search for a feasible flow by use of the method presented in the course. Give a feasible flow if there is one, otherwise explain why there is no feasible flow. u u d d  [2, 5] d [1, 2] v u d d  [0, 1] d [0, 2] E T T d d d ‚ d ‚ [1, 2] d w d du dus u r [2, 4] [1, 3] d d [0, 3] d d   d d [1, 3] d [2, 4] d [0, 1] ‚ d ‚ d d d E du du x [0, 2] y 5. Consider the network (V, A) below with weights on the nodes. The problem is to find a closure (a closure is a subset C of V such that no arc (i, j ) ∈ A has i ∈ C and j outside C ) with maximum total weight. Translate this problem into a max-flow min-cut problem and solve it. 2u T 1u 3u E c −2 u ' −1 u c E −1 u 2 c E −1 u...
View Full Document

Ask a homework question - tutors are online