On robust identification in the square and King grids
From MaRDI portal
(Redirected from Publication:860410)
Recommendations
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
- On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes
- On the identification of sets of points in the square lattice
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- Sequences of optimal identifying codes
Cites work
- scientific article; zbMATH DE number 5228468 (Why is no real title available?)
- An optimal edge-robust identifying code in the triangular lattice
- Bounds for codes identifying vertices in the hexagonal grid
- Bounds on identifying codes
- Codes for identification in the king lattice
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- General bounds for identifying codes in some infinite regular graphs
- Identifying codes with small radius in some infinite regular graphs
- New bounds for codes identifying vertices in graphs
- On Identifying Codes in the Triangular and Square Grids
- On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes
- On a new class of codes for identifying vertices in graphs
- On a new class of identifying codes in graphs
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- On identification in the triangular grid
- On identifying codes
- On identifying codes in the hexagonal mesh
- On robust and dynamic identifying codes
- On the density of identifying codes in the square lattice
- On the identification of sets of points in the square lattice
- Optimal codes for strong identification
- Sequences of optimal identifying codes
- The minimum density of an identifying code in the king lattice.
Cited in
(3)
This page was built for publication: On robust identification in the square and King grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860410)
