Spy-game on graphs: complexity and simple topologies
type: Item
instance of: scholarly article
title: Spy-game on graphs: complexity and simple topologies
zbMATH Open document ID: 1394.91051
author: Nathann Cohen
author: N. Martins
author: Fionn Mc Inerney
author: Nicolas Nisse
author: Stéphane Pérennes
author: Rudini M. Sampaio
published in: Theoretical Computer Science
publication date: 2018-05-15T00:00:00Z
full work available at URL: Spygames1.pdf
Mathematics Subject Classification ID: 91A24
Mathematics Subject Classification ID: 05C57
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6868601
zbMATH Keywords: cops and robber games
zbMATH Keywords: graphs
zbMATH Keywords: PSPACE-hard
MaRDI profile type: Publication
OpenAlex ID: W2594691417
cites work: A game of cops and robbers
cites work: On a generalization of Meyniel's conjecture on the Cops and Robbers game
cites work: Algorithmic construction of sets for k -restrictions
cites work: Patrolling games
cites work: Catching a fast robber on the grid
cites work: Cops and robbers from a distance
cites work: Q3090934
cites work: Cop and Robber Games When the Robber Can Hide and Ride
cites work: Q5282808
cites work: Fundamentals of parameterized complexity
cites work: Cops and robber with constraints
cites work: Pursuing a fast robber on a graph
cites work: Cops and robber game without recharging
cites work: Q4681994
cites work: Tight bounds for eternal dominating sets in graphs
cites work: Cops and robbers is EXPTIME-complete
cites work: Q3635564
cites work: Graphs with equal eternal vertex cover and eternal domination numbers
cites work: Vertex-to-vertex pursuit in a graph
cites work: Patrolling a Border
DOI: 10.1016/J.TCS.2017.11.015
description: scientific article; zbMATH DE number 6868601