On identifying codes in the hexagonal mesh
From MaRDI portal
Publication:1029036
DOI10.1016/j.ipl.2003.09.009zbMath1178.68244OpenAlexW2000868891MaRDI QIDQ1029036
Tero Laihonen, Iiro S. Honkala
Publication date: 9 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2003.09.009
Combinatorics in computer science (68R05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (6)
On identifying codes that are robust against edge changes ⋮ On a new class of identifying codes in graphs ⋮ On robust identification in the square and King grids ⋮ An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid ⋮ New bounds on binary identifying codes ⋮ Liar's domination
Cites Work
- Codes for identification in the king lattice
- Fault-tolerant locating-dominating sets
- Bounds for Codes Identifying Vertices in the Hexagonal Grid
- On a new class of codes for identifying vertices in graphs
- On Identifying Codes in the Triangular and Square Grids
- General bounds for identifying codes in some infinite regular graphs
- Identifying codes with small radius in some infinite regular graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On identifying codes in the hexagonal mesh