On page 251 we saw that 3SAT remains NP-complete even when restricted to formulas in which each literal appears at most twice.
(a) Show that if each literal appears at most once, then the problem is solvable in polynomial time.
(b) Show that INDEPENDENT SET remains NP-complete even in the special case when all the nodes in the graph have degree at most 4.
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.