This preview shows page 1. Sign up to view the full content.
Unformatted text preview: satisfiable if and only if the original formula is satisfiable. 3. Prove that CLIQUE DP m p VERTEX _ COVER DP . 4. Consider the function MAX_CLIQUE such that for any undirected graph G, MAX_CLIQUE( G ) = a list of vertices in a largest clique of G. Prove that CLIQUE DP P if and only if MAX_CLIQUE is computable in polynomial time....
View Full Document
This note was uploaded on 04/13/2010 for the course CSE 725 taught by Professor Long during the Spring '08 term at Ohio State.
- Spring '08