The parameterized complexity of the induced matching problem☆,☆☆
Under an Elsevier user license
open archive
Keywords
Induced matching
Parameterized complexity
Planar graph
Kernelization
Tree decomposition
Cited by (0)
- ☆
Supported by a DAAD-DST exchange program, D/ 05/57666.
- ☆☆
An extended abstract of this work appears under the title “The Parameterized Complexity of the Induced Matching Problem in Planar Graphs” in the proceedings of the 2007 International Frontiers of Algorithmics Workshop (FAW’07), Springer, LNCS 4613, pages 325–336, held in Lanzhou, China, August 01–03, 2007.
Copyright © 2008 Elsevier B.V. All rights reserved.