Adaptive identification in Torii in the King lattice
zbMATH Open1217.05217MaRDI QIDQ540127FDOQ540127
Authors: Yael Ben-Haim, Sylvain Gravier, Julien Moncel, Antoine Lobstein
Publication date: 1 June 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222848
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fault detection; testing in circuits and networks (94C12) Graph theory (05C99) Other types of codes (94B60)
Cited In (7)
- New results on variants of covering codes in Sierpiński graphs
- Identifying codes and searching with balls in graphs
- Identifying codes of degree 4 Cayley graphs over abelian groups
- Adaptive identification of sets of vertices in graphs
- Locating-domination and identification
- Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
- Information retrieval and the average number of input clues
This page was built for publication: Adaptive identification in Torii in the King lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540127)