Identification in \(\mathbb Z^2\) using Euclidean balls
From MaRDI portal
Publication:628317
DOI10.1016/j.dam.2010.12.008zbMath1209.05254OpenAlexW2051200195MaRDI QIDQ628317
Publication date: 10 March 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.12.008
Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10)
Related Items (3)
Identification of points using disks ⋮ Tolerant identification with Euclidean balls ⋮ New bounds on the minimum density of an identifying code for the infinite hexagonal grid
Cites Work
- Unnamed Item
- On a new class of identifying codes in graphs
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- Adaptive identification in graphs
- The minimum density of an identifying code in the king lattice.
- Codes for identification in the king lattice
- Fault-tolerant locating-dominating sets
- On the density of identifying codes in the square lattice
- On the identification of sets of points in the square lattice
- Identifying and locating-dominating codes on chains and cycles
- On robust and dynamic identifying codes
- Identifying Codes and Covering Problems
- On a new class of codes for identifying vertices in graphs
- On Identifying Codes in the Triangular and Square Grids
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- On codes identifying sets of vertices in Hamming spaces
- General bounds for identifying codes in some infinite regular graphs
This page was built for publication: Identification in \(\mathbb Z^2\) using Euclidean balls
