Cop-robber guarding game with cycle robber-region

DOI10.1016/J.TCS.2010.04.014MaRDI QIDQ620952zbMATH OpenOpenAlexFDO

Authors Hiroshi Nagamochi

Publication date 2 February 2011

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

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

zbMATH Keywords

graph algorithmNP-completepursuit-evasion gamespath coveringcop-robber game

Mathematics Subject Classification ID

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

Recommendations

• Cop-Robber Guarding Game with Cycle Robber Region
• scientific article; zbMATH DE number 4064802
• Cop and robber games when the robber can hide and ride
• A game of cops and robbers
• Cops and Robber game without recharging
• Cops and robber game without recharging
• A witness version of the cops and robber game
• On a game of policemen and robber
• The game of cops and eternal robbers
• A cops and robber game in multidimensional grids

Cites work

• A game of cops and robbers
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• How to Guard a Graph?
• Some results about pursuit games on metric spaces obtained through graph theory techniques
• Vertex-to-vertex pursuit in a graph
• `` Strong NP-Completeness Results

Cited in

(8)

• Complexity of the cop and robber guarding game
• Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
• Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
• Cop-Robber Guarding Game with Cycle Robber Region
• The guarding problem -- complexity and approximation
• How to guard a graph against tree moves
• How to guard a graph?
• The guarding game is E-complete

This page was built for publication: Cop-robber guarding game with cycle robber-region

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