The Parameterized Complexity of the Induced Matching Problem in Planar Graphs

DOI10.1007/978-3-540-73814-5_32zbMath1214.05128MaRDI QIDQ3612599

Somnath Sikdar, Hannes Moser

Publication date: 10 March 2009

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73814-5_32

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)