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
- Spring '08
- Graph Theory, Binary relation, Cograph, Power graph analysis, CLIQUE DP