New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid (Q2380847)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5692024
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid |
scientific article; zbMATH DE number 5692024 |
Statements
New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid (English)
0 references
12 April 2010
0 references
identifying code
0 references
king grid
0 references
graph
0 references
density
0 references
0.9562795
0 references
0.9206689
0 references
0.9204088
0 references
0.9127584
0 references
0.9066814
0 references
0.8980552
0 references
0.8976634
0 references
0.8976634
0 references
0 references
