One-visibility cops and robber on trees: optimal cop-win strategies

DOI10.1016/J.TCS.2022.06.011MaRDI QIDQ2079862zbMATH OpenOpenAlexFDO

Authors Boting Yang

Publication date 7 October 2022

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

Full work available at URL https://doi.org/10.1016/j.tcs.2022.06.011

zbMATH Keywords

copnumbercops and robberone-visibility cops and robber game

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• One-visibility cops and robber on trees
• Computing the one-visibility copnumber of trees
• The complexity of zero-visibility cops and robber
• The optimal capture time of the one-cop-moves game
• The role of information in the cop-robber game

Cites work

• A partition approach to lower bounds for zero-visibility cops and robber
• Graph searching and a min-max theorem for tree-width
• scientific article; zbMATH DE number 3997549 (Why is no real title available?)
• Limited visibility cops and robber
• On minimizing width in linear layouts
• One-visibility cops and robber on trees
• Searching and pebbling
• The complexity of searching a graph
• The complexity of zero-visibility cops and robber
• The game of cops and robbers on graphs
• Tree-width, path-width, and cutwidth
• Vertex-to-vertex pursuit in a graph
• Zero-visibility cops and robber and the pathwidth of a graph

Cited in

(9)

• Computing the one-visibility copnumber of trees
• Limited visibility cops and robber
• One-visibility cops and robber on trees
• The optimal capture time of the one-cop-moves game
• The one-visibility localization game
• The zero-visibility cops and robber game on graph products
• Capturing an invisible robber using separators
• The complexity of zero-visibility cops and robber
• The role of information in the cop-robber game

This page was built for publication: One-visibility cops and robber on trees: optimal cop-win strategies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2079862)