New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid
From MaRDI portal
Publication:2380847
DOI10.1007/s12095-009-0015-1zbMath1192.94138OpenAlexW2047220799MaRDI QIDQ2380847
Publication date: 12 April 2010
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-009-0015-1
Related Items (4)
An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid ⋮ Optimal identifying codes in the infinite 3-dimensional king grid ⋮ Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid ⋮ Locating-Domination and Identification
Cites Work
- On a new class of identifying codes in graphs
- The minimum density of an identifying code in the king lattice.
- Codes for identification in the king lattice
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- On a new class of codes for identifying vertices in graphs
- On Identifying Codes in the Triangular and Square Grids
- Identifying codes with small radius in some infinite regular graphs
This page was built for publication: New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid
