New lower bound for 2-identifying code in the square grid (Q2446847)
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 6287227
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New lower bound for 2-identifying code in the square grid |
scientific article; zbMATH DE number 6287227 |
Statements
New lower bound for 2-identifying code in the square grid (English)
0 references
22 April 2014
0 references
identifying code
0 references
domination
0 references
square grid
0 references
infinite grid
0 references
0.9170341
0 references
0.9098269
0 references
0.90862536
0 references
0.8950118
0 references
0.8932381
0 references
0.8841597
0 references
0.88371885
0 references
0.8806517
0 references
0.87547386
0 references
