A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Localization game on geometric and planar graphs
[article]
2017
arXiv
pre-print
The main topic of this paper is motivated by a localization problem in cellular networks. Given a graph G we want to localize a walking agent by checking his distance to as few vertices as possible. The model we introduce is based on a pursuit graph game that resembles the famous Cops and Robbers game. It can be considered as a game theoretic variant of the metric dimension of a graph. We provide upper bounds on the related graph invariant ζ (G), defined as the least number of cops needed to
arXiv:1709.05904v1
fatcat:prmk5irozzby3etqieay5tzw6i