Fast searching games on graphs
type: Item
instance of: scholarly article
title: Fast searching games on graphs
zbMATH Open document ID: 1237.91057
author: Donald Stanley
author: Boting Yang
published in: Journal of Combinatorial Optimization
publication date: 2012-04-04T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A24
zbMATH DE Number: 6021880
zbMATH Keywords: fast searching
zbMATH Keywords: graph searching
zbMATH Keywords: cops-and-robber game
zbMATH Keywords: pursuit-and-evasion problem
zbMATH Keywords: graphs
MaRDI profile type: Publication
full work available at URL: s10878-010-9328-4
OpenAlex ID: W2076264749
cites work: Cleaning Regular Graphs with Brushes
cites work: Q4035355
cites work: Monotonicity in graph searching
cites work: Algorithms for recognition of regular properties and decomposition of recursive graph families
cites work: Some pursuit-evasion problems on grids
cites work: Fugitive-search games on graphs and related parameters
cites work: Lower bounds on the pathwidth of some grid-like graphs
cites work: A 3-approximation for the pathwidth of Halin graphs
cites work: An annotated bibliography on guaranteed graph searching
cites work: Eavesdropping games
cites work: Searching and pebbling
cites work: Recontamination does not help to search a graph
cites work: Topological Bandwidth
cites work: The complexity of searching a graph
cites work: Cleaning a network with brushes
cites work: Optimal Algorithms for a Pursuit-Evasion Problem in Grids
DOI: 10.1007/S10878-010-9328-4
description: scientific article; zbMATH DE number 6021880