On the identification of sets of points in the square lattice
From MaRDI portal
Publication:1864133
DOI10.1007/s00454-002-0730-2zbMath1024.94018MaRDI QIDQ1864133
Tero Laihonen, Iiro S. Honkala
Publication date: 17 March 2003
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-002-0730-2
05C90: Applications of graph theory
94C12: Fault detection; testing in circuits and networks
94B25: Combinatorial codes
Related Items
Extension of universal cycles for globally identifying colorings of cycles, Identification in \(\mathbb Z^2\) using Euclidean balls, On a new class of identifying codes in graphs, On robust identification in the square and King grids, Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice, Adaptive identification in graphs, On the identification problems in products of cycles, On identification in the triangular grid, Liar's domination