Minimum colored Maximum Matchings in vertex-colored Graphs - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2024

Minimum colored Maximum Matchings in vertex-colored Graphs

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 isW[2]-hard with the number of color of the solution as parameter. Next that it is hard to approximate within logarithmic ratio of the number of internal nodes (nodes of degree 2 or more). And finally that it is fixed-parameter tractable with the size of a maximum matching as parameter.
Fichier principal
Vignette du fichier
MCMM.pdf (365.04 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-02157745 , version 1 (17-06-2019)
hal-02157745 , version 2 (24-06-2024)
hal-02157745 , version 3 (09-07-2024)

Licence

Identifiants

  • HAL Id : hal-02157745 , version 3

Citer

Johanne Cohen, Yannis Manoussakis, Jonas Sénizergues. Minimum colored Maximum Matchings in vertex-colored Graphs. 2024. ⟨hal-02157745v3⟩
73 Consultations
201 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More