On robust identification in the square and King grids
From MaRDI portal
Publication:860410
DOI10.1016/J.DAM.2006.03.037zbMath1104.93019OpenAlexW2069819456MaRDI QIDQ860410
Publication date: 9 January 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.03.037
Related Items (3)
On identifying codes that are robust against edge changes ⋮ Liar's domination ⋮ Many-to-many two-disjoint path covers in cylindrical and toroidal grids
Cites Work
- On a new class of identifying codes in graphs
- On identifying codes in the hexagonal mesh
- New bounds for codes identifying vertices in graphs
- The minimum density of an identifying code in the king lattice.
- Codes for identification in the king lattice
- Optimal codes for strong identification
- On identification in the triangular grid
- On the density of identifying codes in the square lattice
- On the identification of sets of points in the square lattice
- An optimal edge-robust identifying code in the triangular lattice
- Bounds for Codes Identifying Vertices in the Hexagonal Grid
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- On robust and dynamic identifying codes
- On a new class of codes for identifying vertices in graphs
- Sequences of optimal identifying codes
- On Identifying Codes in the Triangular and Square Grids
- On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- Bounds on identifying codes
- General bounds for identifying codes in some infinite regular graphs
- Identifying codes with small radius in some infinite regular graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: On robust identification in the square and King grids
