Tolerant identification with Euclidean balls

DOI10.1002/net.21472zbMath1269.68029arXiv1109.1913OpenAlexW2963821124MaRDI QIDQ5326789

Ville Junnila, Aline Parreau, Tero Laihonen

Publication date: 6 August 2013

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.1913

zbMATH Keywords

fault diagnosisoptimal codesensor networkidentifying code

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Identification in \(\mathbb Z^2\) using Euclidean balls
• 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
• An optimal edge-robust identifying code in the triangular lattice
• On identifying codes that are robust against edge changes
• On robust and dynamic identifying codes
• Identifying and Locating–Dominating Codes in (Random) Geometric Networks
• On a new class of codes for identifying vertices in graphs
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid

This page was built for publication: Tolerant identification with Euclidean balls