Cop-robber guarding game with cycle robber-region

DOI10.1016/J.TCS.2010.04.014zbMATH Open1237.91044OpenAlexW2153017110MaRDI QIDQ620952FDOQ620952

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)

Cites Work

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

Cited In (4)

• How to guard a graph against tree moves
• Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
• Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
• The guarding game is E-complete

Recommendations

• Title not available (Why is that?) 👍 👎
• On a game of policemen and robber 👍 👎
• A game of cops and robbers 👍 👎
• Cop and Robber Games When the Robber Can Hide and Ride 👍 👎
• A witness version of the cops and robber game 👍 👎
• The game of cops and eternal robbers 👍 👎
• A cops and robber game in multidimensional grids 👍 👎
• Cops and Robber Game without Recharging 👍 👎
• Cop-Robber Guarding Game with Cycle Robber Region 👍 👎
• Cops and robber game without recharging 👍 👎

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)