This preview shows page 1. Sign up to view the full content.
Unformatted text preview: two nodes) such that every vertex is in exactly one cycle. Give a polynomialtime algorithm to determine whether G has a cycle cover. Justify your algorithm. 3. Suppose we modify the FordFulkerson algorithm so that it always ﬁnds the path with maximum capacity. Explain how this algorithm could be implemented with running time O ( m 2 log n log C ). Justify your answer. Hint: log 1+1 /x y = O ( x log y )...
View
Full
Document
This note was uploaded on 11/30/2010 for the course CSCI 570 taught by Professor Shamsian during the Spring '06 term at USC.
 Spring '06
 Shamsian

Click to edit the document details