Would this be considered a correct definition of the vertex cover problem?
"Set of minimum number of vertices of an undirected graph such that any edge of the graph is incident on at least one vertex in the set "
RK

Would this be considered a correct definition of the vertex cover problem?
"Set of minimum number of vertices of an undirected graph such that any edge of the graph is incident on at least one vertex in the set "
RK
Wikipedia defines Vertex Cover to be
http://en.wikipedia.org/wiki/Vertex_cover_problem
a vertex cover of a graph is a set of vertices such that each edge of the graph touches (is incident with) at least one element of the set.
What if i change the definition to
a vertex cover of a graph is a set of vertices such that ANY edge of the graph touches (is incident with) at least one element of the set.
Does changing the definition from each to ANY make a difference? Is there a catch somewhere. I saw problem definition with the word ANY and i am wondering if it still the Vertex Cover problem definition and hence NPComplete?
RK
« Virtual Reality  My computer has slowed down?!!?! » 