Abstract
We consider a natural generalization of Vertex Cover: the Subset Vertex Cover problem, which is to decide for a graph G=(V,E), a subset T⊆V and integer k, if V has a subset S of size at most k, such that S contains at least one end-vertex of every edge incident
... read more