Problem 1 Chapter 7-3 (a) The value of the flow: 10 Maximum flow: 11 (b) Min cut from s, a, b, c to t, d. Capacity of the min cut is 11. Problem 2 Chapter 7 -12 Idea: Run max-flow algorithm on G, and find a min cut of G, which separates the vertices
CSE 202 Homework 2 Solution
TA: Nan Zang Problem 1 Suppose you are given a connect graph G, with edge costs that are all distinct. Prove that G has a unique MST. Proof: Suppose the graph has two different MSTs, T and T1. Then there must be some edge
CSE 202 Homework 3 Solution
TA: Nan Zang
The solutions in this homework are not complete. I only gave some directions to solve the problem. For algorithm problem, you must give the algorithm, analysis of correctness and time complexity.
Problem 1 Ex
CSE 202 Homework 1 Solution (Revised 1/21/2008)
TA: Nan Zang
Note these are only sketch answers, not full answers.
Problem 1 Solution: False Counter example: Two men {m,m'}. Two women {w,w'} m prefers w to w' m' prefers w' to w w prefers m' to m w'