This preview shows page 1. Sign up to view the full content.
Unformatted text preview: conjunctive normal form with two literals per clause is satisfiable. 2. Write out a clear proof that undirected graph three colorability is NP-complete. Assume that 3-CNF satisfiability is NP-complete. 3. In the directed subgraph below prove that any path that traverses all vertices must enter and leave the subgraph in the same column. Note that the path may enter the subgraph more than once....
View Full Document
This note was uploaded on 09/04/2008 for the course CS 381 taught by Professor Hopcroft during the Fall '06 term at Cornell University (Engineering School).
- Fall '06