The parameterized complexity of the induced matching problem

Discrete Applied Mathematics

Volumn 157, Issue 4, 2009, Pages 715-727

  Moser, Hannes ^a   Sikdar, Somnath ^b  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

Induced matching; Kernelization; Parameterized complexity; Planar graph; Tree decomposition

Indexed keywords

TREES (MATHEMATICS);

INDUCED MATCHING; KERNELIZATION; PARAMETERIZED COMPLEXITY; PLANAR GRAPH; TREE DECOMPOSITION;

GRAPH THEORY;

EID: 59949093421     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.07.011     Document Type: Article

References (42)

1. Alber J., Bodlaender H.L., Fernau H., Kloks T., and Niedermeier R. Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33 4 (2002) 461-493
2. Alber J., Dorn B., and Niedermeier R. A general data reduction scheme for domination in graphs. Proceedings of SOFSEM'06. LNCS vol. 3831 (2006), Springer 137-147
3. Alber J., Fellows M.R., and Niedermeier R. Polynomial-time data reduction for dominating set. Journal of the ACM 51 3 (2004) 363-384
4. Alber J., and Niedermeier R. Improved tree decomposition based algorithms for domination-like problems. Proceedings of LATIN'02. LNCS vol. 2286 (2002), Springer 613-628
5. Bodlaender H.L. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25 6 (1996) 1305-1317
6. Bodlaender H.L. Treewidth: Algorithmic techniques and results. Proceedings of MFCS'97. LNCS vol. 1295 (1997), Springer 19-36
7. Bodlaender H.L. Treewidth: Characterizations, applications, and computations. Proceedings of WG'06. LNCS vol. 4271 (2006), Springer 1-14
8. Cameron K. Induced matchings. Discrete Applied Mathematics 24 (1989) 97-102
9. Cameron K. Induced matchings in intersection graphs. Discrete Mathematics 278 1-3 (2004) 1-9
10. Cameron K., Sritharan R., and Tang Y. Finding a maximum induced matching in weakly chordal graphs. Discrete Mathematics 266 1-3 (2003) 133-142
11. Chen J., Fernau H., Kanj I.A., and Xia G. Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. SIAM Journal on Computing 37 4 (2007) 1077-1106
12. Chlebík M., and Chlebíková J. Approximation hardness of dominating set problems. Proceedings of ESA'04. LNCS vol. 3221 (2004), Springer 192-203
13. Courcelle B. The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and Computation 85 1 (1990) 12-75
14. Downey R., Fellows M.R., and Raman V. The complexity of irredundant sets parameterized by size. Discrete Applied Mathematics 100 3 (2000) 155-167
15. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer
16. Duckworth W., Manlove D., and Zito M. On the approximability of the maximum induced matching problem. Journal of Discrete Algorithms 3 1 (2005) 79-91
17. Faudree R.J., Flandrin E., and Ryjácek Z. Claw-free graphs-A survey. Discrete Mathematics 164 1-3 (1997) 87-147
18. Fellows M.R. The lost continent of polynomial time: Preprocessing and kernelization. Proceedings of IWPEC'06. LNCS vol. 4169 (2006), Springer 276-277
19. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer
20. Fomin F.V., and Thilikos D.M. Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up. Proceedings of ICALP'04. LNCS vol. 3142 (2004), Springer 581-592
21. Fricke G., and Laskar R. String matching in trees. Congressum Numerantium 89 (1992) 239-243
22. Golumbic M.C., and Laskar R. Irredundancy in circular arc graphs. Discrete Applied Mathematics 44 1-3 (1993) 79-89
23. Golumbic M.C., and Lewenstein M. New results on induced matchings. Discrete Applied Mathematics 101 1-3 (2000) 157-165
24. Gotthilf Z., and Lewenstein M. Tighter approximations for maximum induced matchings in regular graphs. Proceedings of WAOA'05. LNCS vol. 3879 (2005), Springer 270-281
25. Guo J., and Niedermeier R. Invitation to data reduction and problem kernelization. ACM SIGACT News 38 1 (2007) 31-45
26. Guo J., and Niedermeier R. Linear problem kernels for NP-hard problems on planar graphs. Proceedings of ICALP'07. LNCS vol. 4596 (2007), Springer 375-386
27. Guo J., Niedermeier R., and Wernicke S. Fixed-parameter tractability results for full-degree spanning tree and its dual. Proceedings of IWPEC'06. LNCS vol. 4169 (2006), Springer 203-214
28. I.A. Kanj, M.J. Pelsmajer, G. Xia, M. Schaefer, On the induced matching problem, in: Proceedings of STACS'08, Internationales Begegnungs- und Forschungszentrum für Informatik, IBFI, Schloss Dagstuhl, Germany, 2008, pp. 397-408
29. Kloks T. Treewidth, Computations and Approximations. LNCS vol. 842 (1994), Springer
30. Kneis J., Mölle D., Richter S., and Rossmanith P. Divide-and-color. Proceedings of WG'06. LNCS vol. 4271 (2006), Springer 58-67
31. Ko C.W., and Shepherd F.B. Bipartite domination and simultaneous matroid covers. SIAM Journal on Discrete Mathematics 16 4 (2003) 517-523
32. 5-free graphs, and in graphs with matching and induced matching of equal maximum size. Algorithmica 37 4 (2003) 327-346
33. Lozin V.V. On maximum induced matchings in bipartite graphs. Information Processing Letters 81 1 (2002) 7-11
34. Lozin V.V., and Rautenbach D. Some results on graphs without long induced paths. Information Processing Letters 88 4 (2003) 167-171
35. Moser H., and Thilikos D.M. Parameterized complexity of finding regular induced subgraphs. Proceedings of ACiD'06. Texts in Algorithmics vol. 7 (2006), College Publications 107-118
36. Niedermeier R. Invitation to Fixed-Parameter Algorithms (2006), Oxford University Press
37. Orlovich Y., Finke G., Gordon V., and Zverovich I. Approximability results for the maximum and minimum maximal induced matching problems. Discrete Optimization 5 (2008) 584-593
38. Raman V., and Saurabh S. Short cycles make W-hard problems hard: FPT algorithms for W-hard problems in graphs with no short cycles. Algorithmica 52 2 (2008) 203-225 10.1007/s00453-007-9148-9
39. Roussopoulos N.D. A max {m, n} algorithm for determining the graph H from its line graph G. Information Processing Letters 2 4 (1973) 108-112
40. Stockmeyer L.J., and Vazirani V.V. NP-completeness of some generalizations of the maximum matching problem. Information Processing Letters 15 1 (1982) 14-19
41. H. Fernau, D. Raible, A parameterized perspective on packing paths of length two, in: Proceedings of COCOA'08, in: LNCS, vol. 5165, Springer, 2008, pp. 54-63. (doi:10.1007/978-3-540-85097-7_6)
42. Zito M. Induced matchings in regular graphs and trees. Proceedings of WG'99. LNCS vol. 1665 (1999), Springer 89-100