This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: c Î» 1 â‰¥ In the above derivation A=I,b=u,D=our adjacency matrix above, and c=[0,. ..,0,-1]. Not-ing the structure in D (every column has one 1 and one -1), we can write our problem as: min y T u s.t. y 9 , 1 + z 9-z 1 â‰¥ 1 y i,j + z i-z j â‰¥ y â‰¥ Using the multipliers given above from Matlab, our minimum cut is U=1,2,5 and V=3,4,6,7,8,9. Notice that the cut could have gone through arc 2 or through both arcs 5 and 17. 2...
View Full Document
- Spring '08
- Trigraph, Flow network, adjacencyÂ matrix, Maximum flow problem