✦ LIBER ✦

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

✍ Scribed by Tero Laihonen

Publisher: Springer Japan
Year: 2006
Tongue: English
Weight: 190 KB
Volume: 22
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-006-0682-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Optimal Edge-Robust Identifying Code

An Optimal Edge-Robust Identifying Code in the Triangular Lattice

✍ Iiro Honkala 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 229 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

Codes for Identification in the King Lat

Codes for Identification in the King Lattice

✍ Iiro Honkala; Tero Laihonen 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 324 KB

On the Density of Identifying Codes in t

On the Density of Identifying Codes in the Square Lattice

✍ 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