A note on the NP-hardness of two matching problems in induced subgrids - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2013

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.
Fichier principal
Vignette du fichier
2133-8309-1-PB.pdf (307.79 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00980770 , version 1 (07-05-2014)

Identifiers

Cite

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⟩
133 View
895 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More