Let L to be all undirected graphs which has Vertex Cover of exact size |v| - 5. Is L P OR NPC? I'm totally confused, how can I prove that?
Vertex Cover is NPC problem but what about now?
Let L to be all undirected graphs which has Vertex Cover of exact size |v| - 5. Is L P OR NPC? I'm totally confused, how can I prove that?
Vertex Cover is NPC problem but what about now?