On identification in the triangular grid
From MaRDI portal
Publication:1826954
DOI10.1016/j.jctb.2003.10.002zbMath1042.05034OpenAlexW2014157723MaRDI QIDQ1826954
Tero Laihonen, Iiro S. Honkala
Publication date: 6 August 2004
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2003.10.002
Related Items (5)
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 ⋮ Adaptive identification in graphs ⋮ Liar's domination
Cites Work
- Unnamed Item
- Unnamed Item
- On identifying codes in binary Hamming spaces
- New bounds for codes identifying vertices in graphs
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- On the complexity of the identification problem in Hamming spaces
- 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
- Bounds for Codes Identifying Vertices in the Hexagonal Grid
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- On a new class of codes for identifying vertices in graphs
- Identifying and locating-dominating codes: NP-completeness results for directed graphs
- General bounds for identifying codes in some infinite regular graphs
- Identifying codes with small radius in some infinite regular graphs
This page was built for publication: On identification in the triangular grid
