Jian-Er Chen

Learn More
A vertex cover of an n-vertex graph with perfect matching contains at least n/2 vertices. In this paper, we study the parameterized complexity of the problem vc-pm* that decides if a given graph with perfect matching has a vertex cover of size bounded by n/2 +k. We first present an algorithm of running time O*(4 k ) for a variation of the vertex cover(More)
  • 1