Unformatted text preview: that you will analyse. You are allowed to collaborate with other students on these problems. But, the write ups should be written by yourself without help from others. If you have any questions regarding how these guidelines apply to a particular problem or what they mean in general please post on the newsgroup or email the TAs. Important Write up each homework problem on a separate sheet and place your name and login on every sheet. Problem 1 There may be several diﬀerent min-cut sets in a graph. Using the analysis of the randomized min-cut algorithm presented in class, argue that there can be at most n ( n-1) / 2 distinct min-cut sets. Problem 2 Excercise 1.7 from the text book. Problem 3 Excercise 1.13 from the text book....
View Full Document
This document was uploaded on 11/03/2009.
- Spring '09