Question: Let G = (V, E) be an undirected graph. An independent set (independent set) I V is a subset of the nodes so that

  1. Let G = (V, E) be an undirected graph. An independent set 

Let G = (V, E) be an undirected graph. An independent set (independent set) I V is a subset of the nodes so that no two nodes from I are connected by an edge. For a given graph G and a natural number kV the problem IS is the question of whether G has a k-element independent set. Prove: IS is NP-complete. Note: Reduce 3-CNF-SAT to IS.

Step by Step Solution

3.54 Rating (158 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

To show that IS is NPcomplete we need to show that it is both in NP and NPhard First lets show that IS is in NP Given a set of nodes I we can check in ... View full answer

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 Civil Engineering Questions!