Scribd
Upload
262 views1 page

Vertex Cover Problem

The vertex cover problem is to find the minimum number of vertices in a graph that cover all the edges, such that each edge is incident to at least one vertex in the cover. It is an NP-complete problem with no known polynomial time solution. However, there are approximate polynomial time algorithms, such as one that iteratively selects an edge, adds its vertices to the cover set, and removes all covered edges, until all edges are processed.

Uploaded by

kanishkavishwasrao21
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
262 views1 page

Vertex Cover Problem

The vertex cover problem is to find the minimum number of vertices in a graph that cover all the edges, such that each edge is incident to at least one vertex in the cover. It is an NP-complete problem with no known polynomial time solution. However, there are approximate polynomial time algorithms, such as one that iteratively selects an edge, adds its vertices to the cover set, and removes all covered edges, until all edges are processed.

Uploaded by

kanishkavishwasrao21
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

Vertex Cover Problem

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. Examples are:

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.

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
Following diagram shows execution of above approximate algorithm.

You might also like