Question: Given an undirected graph G = ( V , E ) , the HALF - CLIQUE problem is to decide if there is a subset

Given an undirected graph G =(V,E), the HALF-CLIQUE problem is to decide if there is a subset A V of vertices satisfying the following two conditions:
|A|(|V |/2)
For every pair of vertices u, v in A, if u = v, then (u, v) in E.
Show that HALF-CLIQUE is in NP-complete.
Hint: Reduce from CLIQUE, which is known to be NP-complete.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!