𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On codes identifying vertices in the two-dimensional square lattice with diagonals

✍ Scribed by Cohen, G.D.; Honkala, L.; Lobstein, A.


Book ID
119773231
Publisher
IEEE
Year
2001
Tongue
English
Weight
100 KB
Volume
50
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the Density of Identifying Codes in t
✍ Iiro Honkala; Antoine Lobstein πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 148 KB

Let G=(V, E) be an undirected graph and C a subset of vertices. If the sets B r (v) 5 C, v Β₯ V, are all nonempty and different, where B r (v) denotes the set of all points within distance r from v, we call C an r-identifying code. We give bounds on the best possible density of r-identifying codes in