Searching for "The parameterized complexity of the induced matching problem." – sorted by Relevance.

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

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

2 documents found, showing 1 through 2.

The parameterized complexity of the induced matching problem in planar graphs
by Hannes Moser, Somnath Sikdar — 2007 — In Proceedings of the 2007 International Frontiers of Algorithmics Workshop, Lecture Notes in Comput. Sci
…The Parameterized Complexity of the Induced Matching Problem 2,3 Hannes Moser 1,∗ Institut für…
Cited by 3 (0 self) – Add To MetaCart

On the Induced Matching Problem
by Iyad Kanj, Michael J. Pelsmajer, Marcus Schaefer, Ge Xia — 2007
… complexity of the induced matching problem on general graphs, it is known that the problem is W[1]-hard [11…
Cited by 2 (0 self) – Add To MetaCart

Showing 1 through 2.

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