Algorithmic Aspects of Upper Domination: A Parameterised Perspective

Abstract : This paper studies Upper Domination, i.e., the problem of computing the maximum cardinality of a minimal dominating set in a graph, with a focus on parameterised complexity. Our main results include W[1]-hardness for Upper Domination, contrasting FPT membership for the parameterised dual Co-Upper Domination. The study of structural properties also yields some insight into Upper Total Domination. We further consider graphs of bounded degree and derive upper and lower bounds for kernelisation.
Type de document :
Communication dans un congrès
11th International Conference Algorithmic Aspects in Information and Management (AAIM), Jul 2016, Bergamo, Italy. 9778, pp.113-124, 2016, Lecture Notes in Computer Science. 〈10.1007/978-3-319-41168-2_10〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01367853
Contributeur : Mathieu Liedloff <>
Soumis le : vendredi 16 septembre 2016 - 18:55:35
Dernière modification le : jeudi 11 janvier 2018 - 06:17:30

Identifiants

Collections

Citation

Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, et al.. Algorithmic Aspects of Upper Domination: A Parameterised Perspective. 11th International Conference Algorithmic Aspects in Information and Management (AAIM), Jul 2016, Bergamo, Italy. 9778, pp.113-124, 2016, Lecture Notes in Computer Science. 〈10.1007/978-3-319-41168-2_10〉. 〈hal-01367853〉

Partager

Métriques

Consultations de la notice

141