A Boundary Property for Upper Domination - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

A Boundary Property for Upper Domination

Résumé

An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard, but can be solved in polynomial time in some restricted graph classes, such as P4-free graphs or 2K2-free graphs. For classes defined by finitely many forbidden induced subgraphs, the boundary separating difficult instances of the problem from polynomially solvable ones consists of the so called boundary classes. However, none of such classes has been identified so far for the upper dominating set problem. In the present paper, we discover the first boundary class for this problem.

Mots clés

Dates et versions

hal-01370014 , version 1 (21-09-2016)

Identifiants

Citer

Hassan Aboueisha, Shahid Hussain, Vadim Lozin, Jérôme Monnot, Bernard Ries, et al.. A Boundary Property for Upper Domination. 27th International Workshop on Combinatorial Algorithms, IWOCA 2016, Aug 2016, Helsinki, Finland. pp.229-240, ⟨10.1007/978-3-319-44543-4_18⟩. ⟨hal-01370014⟩
146 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More