Unformatted text preview: two nodes) such that every vertex is in exactly one cycle. Give a polynomial-time algorithm to determine whether G has a cycle cover. Justify your algorithm. 3. Suppose we modify the Ford-Fulkerson 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
- Spring '06
- Big O notation, Analysis of algorithms, cycle cover