Localization game for random geometric graphs

DOI10.1016/j.ejc.2022.103616zbMath1504.05192arXiv2102.10352OpenAlexW3131033879MaRDI QIDQ2107488

Paweł Prałat, Lyuben Lichev, Dieter Mitsche

Publication date: 1 December 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.10352

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

The localization game on oriented graphs ⋮ Edge and pair queries-random graphs and complexity

Cites Work

• Unnamed Item
• Metric dimension for random graphs
• Locating a robber on a graph
• An extension of the Hoeffding inequality to unbounded random variables
• The longest edge of the random minimal spanning tree
• Localization game on geometric and planar graphs
• A note on the localization number of random graphs: diameter two case
• Locating a robber on a graph via distance queries
• Localization game for random graphs
• A robber locating strategy for trees
• Locating a robber with multiple probes
• Locating a backtracking robber on a tree
• Generalized curvatures
• On the relation between graph distance and Euclidean distance in random geometric graphs
• The isoperimetric inequality
• Random Geometric Graphs
• Bounds on the localization number

This page was built for publication: Localization game for random geometric graphs