Searching for "The Parameterized Complexity of the Induced Matching Problem in Planar Graphs." – 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.

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
… Parameterized Complexity of the Induced Matching Problem in Planar Graphs” in the proceedings of the 2007…
Cited by 3 (0 self) – Add To MetaCart

Showing 1 through 1.

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