Minimum density of identifying codes of king grids-Reference-Cited by-同舟云学术

Minimum density of identifying codes of king grids

Published:2018-10 Issue:10 Volume:341 Page:2708-2719
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Dantas Rennan,Havet Frédéric^ORCID,Sampaio Rudini M.^ORCID

Funder

Funcap

CNPq

ANR

Funcap/CNRS

CAPES

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference18 articles.

1. Watching systems in the king grid;Auger;Graphs Combin.,2013

2. Exact minimum density of codes identifying vertices in the square grid;Ben-Haim;SIAM J. Discrete Math.,2005

3. M. Bouznif, F. Havet, M. Preissman, Minimum-density identifying codes in square grids, in: Proceddings of AAIM 2016, in: Lecture Notes in Computer Science, vol. 9778, Bergamo, Italy, 2016, pp. 77–88.

4. Identifying codes with small radius in some infinite regular graphs;Charon;Electron. J. Combin.,2002

5. G. Cohen, S. Gravier, I. Honkala, A. Lobstein, M. Mollard, C. Payan, G. Zémor, Improved identifying codes for the grid, Comment to [6].

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Density of identifying codes of hexagonal grids with finite number of rows;RAIRO - Operations Research;2024-03

2. Encoding the Shortest Paths in a King's Graph;Fundamental Journal of Mathematics and Applications;2022-10-14

3. Optimal identifying codes of two families of Cayley graphs;Discrete Applied Mathematics;2022-10

4. Spy game: FPT-algorithm, hardness and graph products;Theoretical Computer Science;2022-06

5. Spy Game: FPT-Algorithm and Results on Graph Products;Lecture Notes in Computer Science;2021