Cops and robbers from a distance
type: Item
instance of: scholarly article
title: Cops and robbers from a distance
zbMATH Open document ID: 1200.91042
author: Anthony Bonato
author: Ehsan Chiniforooshan
author: Paweł Prałat
published in: Theoretical Computer Science
publication date: 2010-11-11T00:00:00Z
Mathematics Subject Classification ID: 91A24
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C57
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5815225
zbMATH Keywords: graphs
zbMATH Keywords: cop number
zbMATH Keywords: polynomial time algorithm
zbMATH Keywords: strong product
zbMATH Keywords: NP-hard
zbMATH Keywords: random graph
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.07.003
OpenAlex ID: W1980595063
cites work: A game of cops and robbers
cites work: Q3418339
cites work: On bridged graphs and cop-win graphs
cites work: On the cop number of a graph
cites work: Random graphs.
cites work: Cops and robbers in a random graph
cites work: Q3558603
cites work: Pursuit-Evasion in Models of Complex Networks
cites work: A better bound for the cop number of general graphs
cites work: Q4947393
cites work: Pursuing a fast robber on a graph
cites work: An annotated bibliography on guaranteed graph searching
cites work: Cops and robbers in graphs with large girth and Cayley graphs
cites work: Variations on cops and robbers
cites work: The complexity of pursuit on a graph
cites work: Q5445040
cites work: A note on \(k\)-cop, \(l\)-robber games on graphs
cites work: Q4828516
cites work: Retracts of strong products of graphs
cites work: Q4519896
cites work: Q5585020
cites work: On Meyniel's conjecture of the cop number
cites work: Chasing robbers on random graphs: Zigzag theorem
cites work: Vertex-to-vertex pursuit in a graph
cites work: Q3565878
cites work: A Bound for the Cops and Robbers Problem
DOI: 10.1016/J.TCS.2010.07.003
description: scientific article; zbMATH DE number 5815225