Data Structures and Algorithms

Thank you!

Vertex Cover Problem. A vertex cover set of a graph G=(V,E) is a set of vertices Vi V such that each edge e , is incident to at least one vertex in V. If edge e (u,v) connects two nodes u and u, e said to be an incident to u and an incident to v. The size of a vertex cover set V if the number of vertices in the set (Vi). Prove that finding a vertex cover set of size k is an NP