Minimum-Density Identifying Codes in Square Grids - Inria - Institut national de recherche en sciences et technologies du numérique
Conference Papers Year : 2016

Minimum-Density Identifying Codes in Square Grids

Marwane Bouznif
Myriam Preissmann

Abstract

An identifying code in a graph G is a subset of vertices with the property that for each vertex v ∈ V (G), the collection of elements of C at distance at most 1 from v is non-empty and distinct from the collection of any other vertex. We consider the minimum density d * (S k) of an identifying code in the square grid S k of height k (i.e. with vertex set Z × {1,. .. , k}). Using the Discharging Method, we prove 7 20 + 1 20k ≤ d * (S k) ≤ min 2 5 , 7 20 + 3 10k , and d * (S3) = 7 18 .
Fichier principal
Vignette du fichier
AAIM-grid-code.pdf (340.41 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01346750 , version 1 (19-07-2016)

Identifiers

Cite

Marwane Bouznif, Frédéric Havet, Myriam Preissmann. Minimum-Density Identifying Codes in Square Grids. 11th International Conference, AAIM 2016, Riccardo Dondi, Jul 2016, Bergamo, Italy. pp.77-88, ⟨10.1007/978-3-319-41168-2_7⟩. ⟨hal-01346750⟩
192 View
182 Download

Altmetric

Share

More