Cops and robber game without recharging
type: Item
instance of: scholarly article
title: Cops and robber game without recharging
zbMATH Open document ID: 1262.91037
author: Fedor V. Fomin
author: Petr A. Golovach
author: Daniel Lokshtanov
published in: Theory of Computing Systems
publication date: 2012-12-06T00:00:00Z
Mathematics Subject Classification ID: 91A24
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6113519
zbMATH Keywords: pursuit-evasion games on graphs
zbMATH Keywords: cops and robbers games
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: s00224-011-9360-5
OpenAlex ID: W2046320674
Wikidata QID: Q60488466
cites work: A game of cops and robbers
cites work: Q3418339
cites work: Q3602859
cites work: An annotated bibliography on guaranteed graph searching
cites work: Pursuing a fast robber on a graph
cites work: Cops and Robber Game without Recharging
cites work: Q4198056
cites work: The complexity of pursuit on a graph
cites work: Q5331036
cites work: Q4012191
cites work: Q3739101
cites work: The complexity of searching a graph
cites work: Vertex-to-vertex pursuit in a graph
cites work: Some results about pursuit games on metric spaces obtained through graph theory techniques
cites work: Solution of David Gale's lion and man problem
cites work: The Searchlight Scheduling Problem
DBLP publication ID: journals/mst/FominGL12
DOI: 10.1007/S00224-011-9360-5
description: scientific article; zbMATH DE number 6113519