Abstract
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any induced matching, and if one of them is matched then there is another matching of the same size that matches the other vertex. Motivated by this, Kanj, Pelsmajer, Schaefer and Xia [10] studied induced matchings in twinless graphs. They showed that any twinless planar graph contains an induced matching of size at least \(\frac{n}{40}\) and that there are twinless planar graphs that do not contain an induced matching of size greater than \(\frac{n}{27}+O(1)\). We improve both these bounds to \(\frac{n}{28}+O(1)\), which is tight up to an additive constant. This implies that the problem of deciding an whether a planar graph has an induced matching of size k has a kernel of size at most 28k. We also show for the first time that this problem is FPT for graphs of bounded arboricity.
Kanj et al. presented also an algorithm which decides in \(O(2^{159\sqrt{k}}+n)\)-time whether an n-vertex planar graph contains an induced matching of size k. Our results improve the time complexity analysis of their algorithm. However, we show also a more efficient, \(O(2^{25.5\sqrt{k}}+n)\)-time algorithm. Its main ingredient is a new, O *(4l)-time algorithm for finding a maximum induced matching in a graph of branch-width at most l.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Alon, N., Mubayi, D., Thomas, R.: Large induced forests in sparse graphs. J. Graph Theory 38(3), 113–123 (2001)
Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153–180 (1994)
Biedl, T.C., Demaine, E.D., Duncan, C.A., Fleischer, R., Kobourov, S.G.: Tight bounds on maximal and maximum matchings. Discrete Mathematics 285(1-3), 7–15 (2004)
Chen, Z.-Z.: Efficient approximation schemes for maximization problems on K 3, 3-free graphs. J. Algorithms 26(1), 166–187 (1998)
Chiba, N., Nishizeki, T., Saito, N.: A linear algorithm for five-coloring a planar graph. J. Algorithms 2, 317–327 (1981)
Demaine, E.D., Fomin, F.V., Hajiaghayi, M.T., Thilikos, D.M.: Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. J. ACM 52(6), 866–893 (2005)
Demaine, E.D., Hajiaghayi, M.T., Kawarabayashi, K.: Algorithmic graph minor theory: Decomposition, approximation, and coloring. In: Proc. FOCS 2005, pp. 637–646. IEEE Computer Society Press, Los Alamitos (2005)
Duckworth, W., Manlove, D., Zito, M.: On the approximability of the maximum induced matching problem. J. Discrete Algorithms 3(1), 79–91 (2005)
Fomin, F.V., Thilikos, D.M.: Dominating sets in planar graphs: Branch-width and exponential speed-up. SIAM J. Comput. 36(2), 281–309 (2006)
Kanj, I.A., Pelsmajer, M.J., Xia, G., Schaefer, M.: On the induced matching problem. In: Proc. STACS 2008, pp. 397–408 (2008); Journal version to appear in J. Comput. Sys. Sci.
Kowalik, Ł.: Approximation scheme for lowest outdegree orientation and graph density measures. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 557–566. Springer, Heidelberg (2006)
Moser, H., Sikdar, S.: The parameterized complexity of the induced matching problem in planar graphs. Discrete Applied Mathematics 157, 715–727 (2009)
Moser, H., Thilikos, D.M.: Parameterized complexity of finding regular induced subgraphs. In: Broersma, H., Dantchev, S.S., Johnson, M., Szeider, S. (eds.) Proc. ACiD 2006. Texts in Algorithmics, vol. 7, pp. 107–118. King’s College, London (2006)
Nash-Williams, C.S.J.A.: Decomposition of finite graphs into forests. Journal of the London Mathematical Society 39, 12 (1964)
Nishizeki, T., Baybars, I.: Lower bounds on the cardinality of the maximum matchings of planar graphs. Discrete Mathematics 28(3), 255–267 (1979)
Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14(2), 217–241 (1994)
Stockmeyer, L.J., Vazirani, V.V.: NP-completeness of some generalizations of the maximum matching problem. Inf. Process. Lett. 15(1), 14–19 (1982)
Yannakakis, M.: Node- and edge-deletion NP-complete problems. In: Proc. STOC 1978, pp. 253–264. ACM Press, New York (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Erman, R., Kowalik, Ł., Krnc, M., Waleń, T. (2009). Improved Induced Matchings in Sparse Graphs. In: Chen, J., Fomin, F.V. (eds) Parameterized and Exact Computation. IWPEC 2009. Lecture Notes in Computer Science, vol 5917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11269-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-11269-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11268-3
Online ISBN: 978-3-642-11269-0
eBook Packages: Computer ScienceComputer Science (R0)