Constraint Minimum Vertex Cover in K Partite Graph, Approximation Algorithm and Complexity Analysis

Kamanashis Biswas, S. A. M. Harun

Generally, a graph G, an independent set is a subset S of vertices in G such that no two vertices in S are adjacent (connected by an edge) and a vertex cover is a subset S of verti…