Localization game on geometric and planar graphs

DOI10.1016/j.dam.2018.04.017zbMath1401.05195arXiv1709.05904OpenAlexW2754536942MaRDI QIDQ1627842

Bartłomiej Bosek, Jarosław Grytczuk, Joanna Sokół, Małgorzata Śleszyńska-Nowak, Przemysław Gordinowicz, Nicolas Nisse

Publication date: 3 December 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

cops and robbers gamelocalization problem in cellular networks

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (13)

Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters ⋮ The one-visibility localization game ⋮ The localization game on oriented graphs ⋮ Edge and pair queries-random graphs and complexity ⋮ The localization number of designs ⋮ Unnamed Item ⋮ Centroidal localization game ⋮ The localization game on Cartesian products ⋮ Sequential metric dimension ⋮ Localization game for random graphs ⋮ Hyperopic cops and robbers ⋮ Localization game for random geometric graphs ⋮ The localization capture time of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Locating a robber on a graph
• A game of cops and robbers
• An annotated bibliography on guaranteed graph searching
• Graph searching and a min-max theorem for tree-width
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
• Vertex-to-vertex pursuit in a graph
• Locating a robber on a graph via distance queries
• A robber locating strategy for trees
• Locating a robber with multiple probes
• Locating a backtracking robber on a tree

This page was built for publication: Localization game on geometric and planar graphs