Especially, minimum vertex cover is classical issue in graph theory because of NP-hard.
So, many algorithms for solving minimum vertex cover problem are using approximation algorithm.
 |
| Vertex cover |
 |
| Minimum vertex cover |
2012-01-19
Vertex cover
Vertex cover problem is a set of vertices such that each edge of the graph is incident at least one vertex of the set.
Especially, minimum vertex cover is classical issue in graph theory because of NP-hard.
So, many algorithms for solving minimum vertex cover problem are using approximation algorithm.
Minimum vertex cover is that smallest set of vertices that are vertex cover.
Especially, minimum vertex cover is classical issue in graph theory because of NP-hard.
So, many algorithms for solving minimum vertex cover problem are using approximation algorithm.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment