A simple method for proving lower bounds in the zero-visibility cops and robber game

DOI10.1007/s10878-021-00710-8zbMath1495.91020OpenAlexW3129946810MaRDI QIDQ2156313

Boting Yang, Yuan Xue, Sandra Zilles

Publication date: 18 July 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00710-8

zbMATH Keywords

cops and robberspursuit evasion gameszero-visibility cops and robber game

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (1)

Computing the one-visibility cop-win strategies for trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A game of cops and robbers
• The complexity of zero-visibility cops and robber
• Monotonicity in digraph search problems
• Searching and pebbling
• Vertex-to-vertex pursuit in a graph
• The game of cops and eternal robbers
• Computing the one-visibility copnumber of trees
• The one-cop-moves game on planar graphs
• Cops and robbers is EXPTIME-complete
• A partition approach to lower bounds for zero-visibility cops and robber
• Topological directions in cops and robbers
• Zero-visibility cops and robber and the pathwidth of a graph
• The optimal capture time of the one-cop-moves game
• Monotonicity in graph searching
• Characterizations and algorithms for generalized Cops and Robbers games

This page was built for publication: A simple method for proving lower bounds in the zero-visibility cops and robber game