Exact values for three domination-like problems in circular and infinite grid graphs of small height
Discrete mathematics & theoretical computer science, Tome 21 (2019) no. 3
In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are interested in finding the minimum cardinality of such codes in circular and infinite grid graphs of given height. We provide an alternate proof for already known results, as well as new results. These were obtained by a computer search based on a generic framework, that we developed earlier, for the search of a minimum labeling satisfying a pseudo-d-local property in rotagraphs.
@article{DMTCS_2019_21_3_a11,
author = {Bouznif, Marwane and Darlay, Julien and Moncel, Julien and Preissmann, Myriam},
title = {Exact values for three domination-like problems in circular and infinite grid graphs of small height},
journal = {Discrete mathematics & theoretical computer science},
year = {2019},
volume = {21},
number = {3},
doi = {10.23638/DMTCS-21-3-12},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-21-3-12/}
}
TY - JOUR AU - Bouznif, Marwane AU - Darlay, Julien AU - Moncel, Julien AU - Preissmann, Myriam TI - Exact values for three domination-like problems in circular and infinite grid graphs of small height JO - Discrete mathematics & theoretical computer science PY - 2019 VL - 21 IS - 3 UR - http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-21-3-12/ DO - 10.23638/DMTCS-21-3-12 LA - en ID - DMTCS_2019_21_3_a11 ER -
%0 Journal Article %A Bouznif, Marwane %A Darlay, Julien %A Moncel, Julien %A Preissmann, Myriam %T Exact values for three domination-like problems in circular and infinite grid graphs of small height %J Discrete mathematics & theoretical computer science %D 2019 %V 21 %N 3 %U http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-21-3-12/ %R 10.23638/DMTCS-21-3-12 %G en %F DMTCS_2019_21_3_a11
Bouznif, Marwane; Darlay, Julien; Moncel, Julien; Preissmann, Myriam. Exact values for three domination-like problems in circular and infinite grid graphs of small height. Discrete mathematics & theoretical computer science, Tome 21 (2019) no. 3. doi: 10.23638/DMTCS-21-3-12
Cité par Sources :