On locating-dominating sets in infinite grids
European Journal of Combinatorics
A family of optimal identifying codes in Z2
Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
On robust identification in the square and king grids
Discrete Applied Mathematics
On identifying codes that are robust against edge changes
Information and Computation
Identifying and locating–dominating codes in (random) geometric networks
Combinatorics, Probability and Computing
Improved bounds on identifying codes in binary Hamming spaces
European Journal of Combinatorics
Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes
Mobile Networks and Applications
Identification in Z2 using Euclidean balls
Discrete Applied Mathematics
| Hi-index | 754.84 |
A subset C of vertices in an undirected graph G=(V,E) is called a 1-identifying code if the sets I(v)={u∈C:d(u,v)≤1}, v∈V, are nonempty and no two of them are the same set. It is natural to consider classes of codes that retain the identification property under various conditions, e.g., when the sets I(v) are possibly slightly corrupted. We consider two such classes of robust codes. We also consider dynamic identifying codes, i.e., walks in G whose vertices form an identifying code in G.