Skip to Main content Skip to Navigation
Journal articles

Exact values for three domination-like problems in circular and infinite grid graphs of small height

Marwane Bouznif Julien Darlay 1 Julien Moncel 2 Myriam Preissmann 3
1 Innovation 24 & LocalSolver
Innovation 24 & LocalSolver
2 LAAS-ROC - Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes
LAAS - Laboratoire d'analyse et d'architecture des systèmes
3 G-SCOP_OC [2016-2019] - Optimisation Combinatoire [2016-2019]
G-SCOP [2016-2019] - Laboratoire des sciences pour la conception, l'optimisation et la production [2016-2019]
Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01569881
Contributor : Myriam Preissmann <>
Submitted on : Tuesday, April 30, 2019 - 12:05:50 PM
Last modification on : Wednesday, August 5, 2020 - 3:01:18 AM

File

BouDarMonPreFinal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01569881, version 3
  • ARXIV : 1708.00758

Citation

Marwane Bouznif, Julien Darlay, Julien Moncel, Myriam Preissmann. Exact values for three domination-like problems in circular and infinite grid graphs of small height. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2019, 21 (3). ⟨hal-01569881v3⟩

Share

Metrics

Record views

117

Files downloads

422