Cops and robber on butterflies and solid grids

DOI10.1007/978-3-030-67899-9_21MaRDI QIDQ831728zbMATH OpenOpenAlexFDO

Authors Sheikh Shakil Akhtar, Sandip Das, Harmender Gahlawat

Publication date 24 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-67899-9_21

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• A game of cops and robbers
• Catching a fast robber on the grid
• Cops and robbers is EXPTIME-complete
• Game of cops and robbers in oriented quotients of the integer grid
• Graph searching and a min-max theorem for tree-width
• On a game of policemen and robber
• On the cop number of a graph
• Pursuing a fast robber on a graph
• Randomized Pursuit-Evasion with Local Visibility
• Searching and sweeping graphs: a brief survey
• The capture time of grids
• The complexity of pursuit on a graph
• The game of cops and robbers on graphs
• Variations of cops and robbers game on grids
• Vertex-to-vertex pursuit in a graph

Cited in

(2)

• A cops and robber game in multidimensional grids
• Prisoners and guards on rectangular boards

This page was built for publication: Cops and robber on butterflies and solid grids

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