Login / Signup

The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.

Sounaka MishraVenkatesh RamanSaket SaurabhSomnath SikdarC. R. Subramanian
Published in: ISAAC (2007)
Keyphrases
  • search algorithm
  • computational complexity