Searching for "The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Subramanian The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex
by Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian — Cover Number, ISAAC
…The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number Sounaka…
Cited by 3 (1 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB