Funder
European Commission
European Research Council
National Science Foundation
Studienstiftung des Deutschen Volkes
European Metrology Programme for Innovation and Research
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference27 articles.
1. Randomized pursuit-evasion in graphs;Adler;Combin. Probab. Comput.,2003
2. Efficient algorithms for combinatorial problems on graphs with bounded decomposability—a survey;Arnborg;BIT,1985
3. Finding a princess in a palace: a pursuit-evasion problem;Britnell;Electron. J. Combin.,2013
4. Locating a robber on a graph via distance queries;Carraher;Theoret. Comput. Sci.,2012
5. I. Chatzigiannakis, S. Nikoletseas, P. Spirakis, An efficient communication strategy for ad-hoc mobile networks, in: Proc. 20th ACM Symposium on Principles of Distributed Computing, 2001, pp. 320–322.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters;SIAM Journal on Discrete Mathematics;2023-10-10
2. Localization game for random geometric graphs;European Journal of Combinatorics;2023-02
3. The Localization game on locally finite trees;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
4. The localization capture time of a graph;Theoretical Computer Science;2022-04
5. Localization game for random graphs;Discrete Applied Mathematics;2022-03