Published January 1, 2013
| Version v1
Journal article
Open
A note on the NP-hardness of two matching problems in induced subgrids
Description
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.
Files
bib-3d2d1c91-bc1c-4fad-9e8e-e0be413fa681.txt
Files
(173 Bytes)
| Name | Size | Download all |
|---|---|---|
|
md5:a3db0bd46adf301ee3987d539486a88e
|
173 Bytes | Preview Download |