A note on the NP-hardness of two matching problems in induced subgrids

Marc Demange (1, 2) , Tinaz Ekim (3)

1 ESSEC Business School
2 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision
3 Industrial Engineering Department [Istanbul]

Given a graph, finding the maximal matching of minimum size (MMM) and the induced matching of maximum size (MIM) have been very popular research topics during the last decades. In this paper, we give new complexity results, namely the NP-hardness of MMM and MIM in induced subgrids and we point out some promising research directions. We also sketch the general framework of a unified approach to show the NP-hardness of some problems in subgrids.

Domaines: Mathématique discrète [cs.DM]

Marc Demange, Tinaz Ekim. A note on the NP-hardness of two matching problems in induced subgrids. Discrete Mathematics and Theoretical Computer Science, 2013, Vol. 15 no. 2 (2), pp.233--242. ⟨10.46298/dmtcs.606⟩. ⟨hal-00980770⟩