This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Consider using Clique Problem for your reduction). http://en.wikipedia.org/wiki/Graph isomorphism problem http://en.wikipedia.org/wiki/Subgraph isomorphism problem 4. An instance of the dominating set problem consists of: a graph G with a set V of vertices and a set E of edges, and a positive integer K smaller than or equal to the number of vertices in G. The problem is to determine whether there is a dominating set of size K or less for G. In other words, we want to know if there is a subset D of V of size less than or equal to K such that every vertex not in D is joined to at least one member of D by an edge in E. Prove that Dominating set problem is NP-complete. (Hint: Consider using Vertex Cover for your reduction) 5. Show that 4-SAT problem is NP-complete. Generalize this to m-SAT, any m ≥ 4. 1...
View Full Document
This note was uploaded on 01/15/2012 for the course COT 5405 taught by Professor Ungor during the Fall '08 term at University of Florida.
- Fall '08