HW7 - two nodes) such that every vertex is in exactly one...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Homework #7 Due Date: Wednesday, December 1st, start of class 1. Consider the class of 3-SAT instances in which each of the n variables occur – counting positive and negative appearances combined – in exactly three clauses. Furthermore, no variable will show up twice in the same clause. Show how to find a satisfying assignment using network flow. Hint: How many clauses are there? 2. A cycle cover of a directed graph G is a set of cycles (a cycle must include at least
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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 finds 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.

Ask a homework question - tutors are online