✦ LIBER ✦

An Optimal Edge-Robust Identifying Code in the Triangular Lattice

✍ Scribed by Iiro Honkala

Publisher: Springer
Year: 2004
Tongue: English
Weight: 229 KB
Volume: 8
Category: Article
ISSN: 0218-0006
DOI: 10.1007/s00026-004-0222-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimalt-Edge-Robustr-Identifying Codes

Optimalt-Edge-Robustr-Identifying Codes in the King Lattice

✍ Tero Laihonen 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 190 KB

The minimum density of an identifying co

The minimum density of an identifying code in the king lattice

✍ Irène Charon; Iiro Honkala; Olivier Hudry; Antoine Lobstein 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 324 KB

Consider a connected undirected graph G =(V; E) and a subset of vertices C. If for all vertices v ∈ V , the sets Br(v) ∩ C are all nonempty and di erent, where Br(v) denotes the set of all points within distance r from v, then we call C an r-identifying code. For all r, we give the exact value of th