Skip to Main content Skip to Navigation
Journal articles

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

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Wednesday, May 7, 2014 - 3:42:11 PM
Last modification on : Tuesday, January 25, 2022 - 8:30:02 AM
Long-term archiving on: : Thursday, August 7, 2014 - 10:36:59 AM


Files produced by the author(s)



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



Record views


Files downloads