Locating a robber on a graph via distance queries
type: Item
instance of: scholarly article
title: Locating a robber on a graph via distance queries
zbMATH Open document ID: 1258.91041
author: Ilkyoo Choi
author: Michelle Delcourt
author: Lawrence H. Erickson
author: Douglas B. West
author: James M. Carraher
published in: Theoretical Computer Science
publication date: 2013-01-07T00:00:00Z
Mathematics Subject Classification ID: 91A43
zbMATH DE Number: 6122455
zbMATH Keywords: graph searching
zbMATH Keywords: cops and robbers
zbMATH Keywords: metric dimension
zbMATH Keywords: resolving set
zbMATH Keywords: subdivision
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.06.035
OpenAlex ID: W2036432387
cites work: Q3418339
cites work: Resolvability in graphs and the metric dimension of a graph
cites work: An annotated bibliography on guaranteed graph searching
cites work: Q4119237
cites work: Q5506519
cites work: Randomized Pursuit-Evasion with Local Visibility
cites work: Landmarks in graphs
cites work: Sensing and filtering. A fresh perspective based on preimages and information spaces. Print version of Foundations and Trends in Robotics Vol. 1, No. 4 (2010)
cites work: Metric bases in digital geometry
cites work: Vertex-to-vertex pursuit in a graph
cites work: Q4159394
cites work: Locating a robber on a graph
cites work: Graph searching and a min-max theorem for tree-width
cites work: Q4075485
DOI: 10.1016/J.TCS.2012.06.035
description: scientific article; zbMATH DE number 6122455