Question: Consider this algorithm for solving the CLIQUE problem. First, generate all subsets of the vertices containing exactly (k) vertices. There are (Oleft(n^{k}ight)) such subsets altogether.
Consider this algorithm for solving the CLIQUE problem. First, generate all subsets of the vertices containing exactly \(k\) vertices. There are \(O\left(n^{k}ight)\) such subsets altogether. Then, check whether any subgraphcs induced by these subsets is complete. If this algorithm ran in polynomial time, what would be its significance? Why is this not a polynomial-time algorithm for the CLIQUE problem?
Step by Step Solution
3.37 Rating (163 Votes )
There are 3 Steps involved in it
If the algorithm you described for solving the CLIQUE problem ran in polynomial time it would ... View full answer
Get step-by-step solutions from verified subject matter experts
