Prove that the following problem is NP-complete: given an undirected graph
G =(V, E) and an integer k, return a clique of size k as well as an independent set of size k, provided both exist.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.