The one-visibility localization game

DOI10.1016/j.tcs.2023.114186arXiv2301.03534OpenAlexW4386786301MaRDI QIDQ6073890

Trent G. Marbach, Anthony Bonato, Michael Molnar, JD Nir

Publication date: 12 October 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

isoperimetric inequalitiespursuit-evasion gamesgraphslimited visibilitylocalization number

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Centroidal localization game
• Locating a robber on a graph
• Compressions and isoperimetric inequalities
• The complexity of zero-visibility cops and robber
• A note on isoperimetric peaks of complete trees
• Bounds on isoperimetric values of trees
• Localization game on geometric and planar graphs
• Locating a robber on a graph via distance queries
• One-visibility cops and robber on trees: optimal cop-win strategies
• The localization capture time of a graph
• Computing the one-visibility cop-win strategies for trees
• Searching for an intruder on graphs and their subdivisions
• Limited visibility cops and robber
• One-visibility cops and robber on trees
• Zero-visibility cops and robber and the pathwidth of a graph
• A robber locating strategy for trees
• A lower bound for the vertex boundary-width of complete \(k\)-ary trees
• Locating a backtracking robber on a tree
• A Separator Theorem for Nonplanar Graphs
• An Invitation to Pursuit-Evasion Games and Graph Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The one-visibility localization game