Playing with Parameters: Cross-parameterization in Graphs

Abstract : When considering a graph problem from a parameterized point of view, the parameter chosen is often the size of an optimal solution of this problem (the "standard"). A natural subject for investigation is what happens when we parameterize such a problem by the size of an optimal solution of a different problem. We provide a framework for doing such analysis. In particular, we investigate seven natural vertex problems, along with their respective parameters: α (the size of a maximum independent set), τ (the size of a minimum vertex cover), ω (the size of a maximum clique), χ (the chromatic number), γ (the size of a minimum dominating set), i (the size of a minimum independent dominating set) and ν (the size of a minimum feedback vertex set). We study the parameterized complexity of each of these problems with respect to the standard parameter of the others.
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00874243
Contributeur : Eleni Palaiologou <>
Soumis le : jeudi 17 octobre 2013 - 14:22:06
Dernière modification le : mercredi 28 septembre 2016 - 16:01:06
Document(s) archivé(s) le : vendredi 7 avril 2017 - 12:35:03

Fichier

cahier_342.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00874243, version 1

Collections

Citation

Nicolas Bourgeois, Konrad Kazimierz Dabrowski, Marc Demange, Vangelis Paschos. Playing with Parameters: Cross-parameterization in Graphs. 2013. 〈hal-00874243〉

Partager

Métriques

Consultations de
la notice

245

Téléchargements du document

82