Maximum Induced Matchings in Grids
An induced matching in a graph is a matching such that no two edges are joined by an edge of G. For a connected graph G, denote by iμ(G) the maximum cardinality of an induced matching in G. In this paper we study the proble of finding a maximum induced matching in grid graphs with n lines and m columns—G n, m , and determine the exact value for iμ(G n, m ) when n or m are even.
I would like to thank Marc Demange from ESSEC Business School for suggesting me this problem and for his support.
- 1.Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., and Stougie, L.: Minimizing flow time in the wireless gathering problem. ACM Transactions on Algorithms7(3), (2011) http://arxiv.org/abs/0802.2836.
- 5.Dabrowski, K., Demange, M., and Lozin, V.V.: New results on maximum induced matchings in bipartite graphs and beyond. submitted, http://homepages.warwick.ac.uk/~mariaq/
- 11.Stockmeyer, L.J., Vazirani, V.V.: Np-completeness of some generalizations of the maximum matching problem. I.P.L. 15, 14–19 (1982)Google Scholar