Locating a robber on a graph via distance queries
From MaRDI portal
Publication:1929218
DOI10.1016/j.tcs.2012.06.035zbMath1258.91041MaRDI QIDQ1929218
Ilkyoo Choi, Michelle Delcourt, Douglas B. West, Lawrence H. Erickson, James M. Carraher
Publication date: 7 January 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.035
91A43: Games involving graphs
Related Items
Sequential metric dimension, Unnamed Item, The one-visibility localization game, The localization game on oriented graphs, Edge and pair queries-random graphs and complexity, The localization number of designs, Complexity of metric dimension on planar graphs, An evasion game on a graph, The robber locating game, Centroidal localization game, Locating a robber on a graph, Localization game on geometric and planar graphs, Approximately locating an invisible agent in a graph with relative distance queries, The cat and the noisy mouse, A note on the localization number of random graphs: diameter two case, Localization game for random graphs, Localization game for random geometric graphs, The localization capture time of a graph, On the status sequences of trees, The localization game on Cartesian products, A robber locating strategy for trees, Locating a robber with multiple probes, Locating a backtracking robber on a tree, Subdivisions in the robber locating game
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Locating a robber on a graph
- An annotated bibliography on guaranteed graph searching
- Graph searching and a min-max theorem for tree-width
- Resolvability in graphs and the metric dimension of a graph
- Vertex-to-vertex pursuit in a graph
- Landmarks in graphs
- Sensing and Filtering: A Fresh Perspective Based on Preimages and Information Spaces
- Metric bases in digital geometry
- Randomized Pursuit-Evasion with Local Visibility
