QUESTION
A graph G has an independent set of size k if there is a set V of k nodes in G so that no two nodes in V share an edge.
Let INDEPENDENT-SET = { <G, k> | G is a graph with an independent set of size k }.
a. (5) Show that INDEPENDENT-SET exists within NP by writing either a verifier or an NDTM.
b. (15) Show that INDEPENDENT-SET is NP-complete by reduction from VERTEX-COVER.
Related Questions