A partition approach to lower bounds for zero-visibility cops and robber

DOI10.1007/978-3-030-25005-8_36MaRDI QIDQ2301762zbMATH OpenOpenAlexFDO

Authors Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles

Publication date 25 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-25005-8_36

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Recommendations

• A simple method for proving lower bounds in the zero-visibility cops and robber game
• Fine-grained Lower Bounds on Cops and Robbers
• Zero-visibility cops and robber and the pathwidth of a graph
• Zero-visibility cops and robber game on a graph
• An introduction to lazy cops and robbers on graphs
• A tight lower bound for the capture time of the cops and robbers game
• A tight lower bound for the capture time of the cops and robbers game
• Visibility graphs, dismantlability, and the cops and robbers game
• Cops and Robbers on Graphs of Bounded Diameter

Cited in

(6)

• Computing the one-visibility copnumber of trees
• One-visibility cops and robber on trees: optimal cop-win strategies
• A simple method for proving lower bounds in the zero-visibility cops and robber game
• One-visibility cops and robber on trees
• New results on the zero-visibility cops and robber game
• Capturing an invisible robber using separators

This page was built for publication: A partition approach to lower bounds for zero-visibility cops and robber

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