Adaptive identification in graphs
From MaRDI portal
Publication:958720
DOI10.1016/j.jcta.2007.12.009zbMath1183.94063OpenAlexW2092469145MaRDI QIDQ958720
Julien Moncel, Yael Ben-Haim, Sylvain Gravier, Antoine C. Lobstein
Publication date: 8 December 2008
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2007.12.009
Applications of graph theory to circuits and networks (94C15) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (6)
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters ⋮ Identification in \(\mathbb Z^2\) using Euclidean balls ⋮ Adaptive identification in graphs ⋮ Sequential metric dimension ⋮ Identifying codes of degree 4 Cayley graphs over abelian groups ⋮ Identifying codes and searching with balls in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On identifying codes in binary Hamming spaces
- Adaptive identification in graphs
- On a 2-dimensional search problem
- The minimum density of an identifying code in the king lattice.
- Construction of codes identifying sets of vertices
- On identification in the triangular grid
- On the identification of sets of points in the square lattice
- On a new class of codes for identifying vertices in graphs
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- Perfect Codes in the Lee Metric and the Packing of Polyominoes
- On codes identifying sets of vertices in Hamming spaces
- 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: Adaptive identification in graphs
