# Vertex Cover Problem | Set 1 (Introduction and Approximate Algorithm)

A vertex cover of an undirected graph is a subset of its vertices such that for every edge (u, v) of the graph, either ‘u’ or ‘v’ is in vertex cover. Although the name is Vertex Cover, the set covers all edges of the given graph. Given an undirected graph, the vertex cover problem is to find minimum size vertex cover.

Following are some examples.

Vertex Cover Problem is a known NP Complete problem, i.e., there is no polynomial time solution for this unless P = NP. There are approximate polynomial time algorithms to solve the problem though. Following is a simple approximate algorithm adapted from CLRS book.

Approximate Algorithm for Vertex Cover:

```1) Initialize the result as {}
2) Consider a set of all edges in given graph.  Let the set be E.
3) Do following while E is not empty
...a) Pick an arbitrary edge (u, v) from set E and add 'u' and 'v' to result
...b) Remove all edges from E which are either incident on u or v.
4) Return result ```

Below diagram to show execution of above approximate algorithm:

How well the above algorithm perform?
It can be proved that the above approximate algorithm never finds a vertex cover whose size is more than twice the size of minimum possible vertex cover (Refer this for proof)

Implementation:
Following are C++ and Java implementations of above approximate algorithm.

## C++

 `// Program to print Vertex Cover of a given undirected graph ` `#include ` `#include ` `using` `namespace` `std; ` ` `  `// This class represents a undirected graph using adjacency list  ` `class` `Graph ` `{ ` `    ``int` `V;    ``// No. of vertices ` `    ``list<``int``> *adj;  ``// Pointer to an array containing adjacency lists ` `public``: ` `    ``Graph(``int` `V);  ``// Constructor ` `    ``void` `addEdge(``int` `v, ``int` `w); ``// function to add an edge to graph ` `    ``void` `printVertexCover();  ``// prints vertex cover ` `}; ` ` `  `Graph::Graph(``int` `V) ` `{ ` `    ``this``->V = V; ` `    ``adj = ``new` `list<``int``>[V]; ` `} ` ` `  `void` `Graph::addEdge(``int` `v, ``int` `w) ` `{ ` `    ``adj[v].push_back(w); ``// Add w to v’s list. ` `    ``adj[w].push_back(v); ``// Since the graph is undirected ` `} ` ` `  `// The function to print vertex cover ` `void` `Graph::printVertexCover() ` `{ ` `    ``// Initialize all vertices as not visited. ` `    ``bool` `visited[V]; ` `    ``for` `(``int` `i=0; i::iterator i; ` ` `  `    ``// Consider all edges one by one ` `    ``for` `(``int` `u=0; u

## Java

 `// Java Program to print Vertex Cover of a given undirected graph ` `import` `java.io.*; ` `import` `java.util.*; ` `import` `java.util.LinkedList; ` ` `  `// This class represents an undirected graph using adjacency list ` `class` `Graph ` `{ ` `    ``private` `int` `V;   ``// No. of vertices ` ` `  `    ``// Array  of lists for Adjacency List Representation ` `    ``private` `LinkedList adj[]; ` ` `  `    ``// Constructor ` `    ``Graph(``int` `v) ` `    ``{ ` `        ``V = v; ` `        ``adj = ``new` `LinkedList[v]; ` `        ``for` `(``int` `i=``0``; i i; ` ` `  `        ``// Consider all edges one by one ` `        ``for` `(``int` `u=``0``; u

Output:

`0 1 3 4 5 6`

Time Complexity of above algorithm is O(V + E).

Exact Algorithms:
Although the problem is NP complete, it can be solved in polynomial time for following types of graphs.
1) Bipartite Graph
2) Tree Graph

The problem to check whether there is a vertex cover of size smaller than or equal to a given number k can also be solved in polynomial time if k is bounded by O(LogV) (Refer this)

We will soon be discussing exact algorithms for vertex cover.

My Personal Notes arrow_drop_up

Article Tags :
Practice Tags :

3

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.