Definition of Vertex Cover Problem:
Vertex Cover is an NP-Complete problem if:
1. Vertex Cover is in NP
2. Independent Set problem polynomial time reducible to Vertex Cover
Language: VERTEX-COVER={<G, K>| where G has a vertex cover set of K size}
1)prove |V’| = K.
2)For each edge (u, v) ∈ E, check is there either u∈V’or v∈V’.
Step1 costs O(C) times, Step2 costs O(|E|) times.
Thus, Step1 + Step2 cost polynomial time.
Conclusion: Vertex Cover is in NP.
What is Independent Set?
Independent set is a set of vertexes which satisfy the following condition:
Language: INDEPENDENT-SET = {<G,K>| where G has an independent set of size K}