The optimal capture time of the one-cop-moves game

DOI10.1016/J.TCS.2015.04.005zbMATH Open1326.05093OpenAlexW2017334312MaRDI QIDQ2348264FDOQ2348264

Authors: Boting Yang, William Hamilton 

Publication date: 11 June 2015

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

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

Recommendations

• One-visibility cops and robber on trees: optimal cop-win strategies
• One-visibility cops and robber on trees
• The one-cop-moves game on graphs of small treewidth
• The capture time of a graph
• The one-cop-moves game on graphs with some special structures

zbMATH Keywords

cops-and-robber gamegraph searchingcapture time

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Cites Work

• The capture time of a graph
• Vertex-to-vertex pursuit in a graph
• A note on \(k\)-cop, \(l\)-robber games on graphs
• Variations on cops and robbers
• On Meyniel's conjecture of the cop number
• The game of cops and robbers on graphs
• A bound for the cops and robbers problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• A game of cops and robbers
• Characterizations and algorithms for generalized cops and robbers games
• Cop-win graphs with maximum capture-time
• When does a random graph have constant cop number?
• Searching and sweeping graphs: a brief survey
• Title not available (Why is that?)
• Characterizations of \(k\)-copwin graphs
• Extensive Games
• A better bound for the cop number of general graphs
• The capture time of grids
• Graphs and composite games
• Zero-visibility cops and robber and the pathwidth of a graph

Cited In (9)

• The one-cop-moves game on graphs with some special structures
• Guarding isometric subgraphs and cops and robber in planar graphs
• Title not available (Why is that?)
• Capture times in the bridge-burning cops and robbers game
• The one-cop-moves game on planar graphs
• Linguistic geometry approach for solving the cops and robber problem in grid environments
• 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
• Cops and robbers on graphs with a set of forbidden induced subgraphs

This page was built for publication: The optimal capture time of the one-cop-moves game

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