On the complexity of Minimum colored Maximum Matching
Résumé
We deal with three aspects of the complexity of the problem of finding a maximum matching that minimizes the number of colors in a vertex-colored graph. We first prove that it is W[2]-hard, next that it is hard to approximate in a similar way as the Set Cover problem, and finally that it is fixed-parameter tractable for a suitable (yet meaningful) choice of parameter.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...