Minimum-Density Identifying Codes in Square Grids
From MaRDI portal
Publication:2830060
DOI10.1007/978-3-319-41168-2_7zbMath1477.68206OpenAlexW2255487088MaRDI QIDQ2830060
Frédéric Havet, Myriam Preissmann, Marwane Bouznif
Publication date: 9 November 2016
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01346750/file/AAIM-grid-code.pdf
Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Density (toughness, etc.) (05C42)
Related Items
Periodicity of identifying codes in strips, Operads of finite posets, On the minimum size of an identifying code over all orientations of a graph, Identifying codes for infinite triangular grids with a finite number of rows, Minimum density of identifying codes of king grids, Minimum density of identifying codes of king grids, Locating-Domination and Identification
Uses Software
Cites Work
- Optimal lower bound for 2-identifying codes in the hexagonal grid
- Identifying codes in some subgraphs of the square lattice
- A family of optimal identifying codes in \(\mathbb Z^2\)
- New bounds for codes identifying vertices in graphs
- Fault-tolerant locating-dominating sets
- New lower bound for 2-identifying code in the square grid
- New bounds on the minimum density of an identifying code for the infinite hexagonal grid
- On a new class of codes for identifying vertices in graphs
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- General bounds for identifying codes in some infinite regular graphs
