...well its certainly not a minimum vertex cover since for G=(V,E) "A vertex
cover (or hitting set) is a subset S of vertices such that each edge of G
has at least one of its endpoints in S. The minimum vertex cover problem is
to find a vertex cover with the smallest number of vertices."
|