# Minimum-density identifying codes in square grids

1 G-SCOP_OC - OC
G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production
2 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : An identifying code in a graph $G$ is a subset of vertices with the property that for each vertex $v \in 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^*({\cal S}_k)$ of an identifying code in the square grid ${\cal S}_k$ of height $k$ (i.e. with vertex set $\mathbb{Z} \times \{1, \dots , k\}$). Using the Discharging Method, we prove $\displaystyle \frac{7}{20} + \frac{1}{20k} \leq d^*({\cal S}_k) \leq \min \left\{\frac{2}{5}, \frac{7}{20} + \frac{3}{10k} \right\}$, and $\displaystyle d^*({\cal S}_3) =\frac{3}{7}$.
Document type :
Reports

Cited literature [6 references]

https://hal.inria.fr/hal-01259550
Contributor : Frederic Havet <>
Submitted on : Wednesday, January 20, 2016 - 3:51:44 PM
Last modification on : Monday, April 8, 2019 - 10:28:39 AM
Long-term archiving on : Thursday, April 21, 2016 - 11:12:38 AM

### File

RR-8845.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : hal-01259550, version 1

### Citation

Marwane Bouznif, Frédéric Havet, Myriam Preissmann. Minimum-density identifying codes in square grids. [Research Report] RR-8845, INRIA Sophia Antipolis - I3S. 2016. ⟨hal-01259550⟩

Record views