In class, we covered the Clique problem, in which we were given a graph G and had to find the largest clique in G. Recall that a clique is a set of nodes such that every node is connected to every other node in the set (i.e., everybody in the set knows everybody else in the set). The Clique-3 problem is the same problem, except that we are guaranteed that every node has degree at most 3.
Suppose that I want to prove that Clique-3 is NP-Complete. To do this, I make the following argument: We know that the Clique problem is NPComplete. Clique-3 reduces to Clique, because if we can solve Clique for graphs in general, then clearly we can also solve it for graphs where the nodes have degree at most 3. Thus, Clique-3 is also NP-Complete.
Part a: What is wrong with the above argument?
Part b: Show that Clique-3 is not NP-Complete (assuming that P 6= NP). (Hint: what is the largest possible clique in a graph where the nodes have degree at most 3?)
Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.
You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.Read more
Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.Read more
Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.Read more
Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.Read more
By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.Read more