Question: Assuming that VERTEX COVER is (mathcal{N} mathcal{P})-complete, prove that CLIQUE is also (mathcal{N} mathcal{P})-complete by finding a polynomial time reduction from VERTEX COVER to CLIQUE.
Assuming that VERTEX COVER is \(\mathcal{N} \mathcal{P}\)-complete, prove that CLIQUE is also \(\mathcal{N} \mathcal{P}\)-complete by finding a polynomial time reduction from VERTEX COVER to CLIQUE.
Step by Step Solution
3.37 Rating (153 Votes )
There are 3 Steps involved in it
Your question refers to two essential problems in computational theory VERTEX COVER and CLIQUE Both of these problems fall under NPcomplete problems a ... View full answer
Get step-by-step solutions from verified subject matter experts
