Locating a robber with multiple probes
From MaRDI portal
Publication:2411615
DOI10.1016/J.DISC.2017.08.028zbMath1372.05140arXiv1703.06482OpenAlexW2742357320MaRDI QIDQ2411615
John Haslegrave, Sebastian Koch, Richard A. B. Johnson
Publication date: 24 October 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.06482
Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Connectivity (05C40) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (11)
Localization game on geometric and planar graphs ⋮ Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters ⋮ The localization number of designs ⋮ Unnamed Item ⋮ A note on the localization number of random graphs: diameter two case ⋮ Centroidal localization game ⋮ The localization game on Cartesian products ⋮ Sequential metric dimension ⋮ Localization game for random graphs ⋮ Localization game for random geometric graphs ⋮ The localization capture time of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cop vs. gambler
- An evasion game on a graph
- The robber locating game
- Locating a robber on a graph
- Graph minors. I. Excluding a forest
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Cops and robbers in graphs with large girth and Cayley graphs
- The vertex separation number of a graph equals its path-width
- The vertex separation and search number of a graph
- Vertex-to-vertex pursuit in a graph
- Locating a robber on a graph via distance queries
- Finding a princess in a palace: a pursuit-evasion problem
- Locating a backtracking robber on a tree
- Subdivisions in the robber locating game
- The complexity of searching a graph
- Randomized Pursuit-Evasion in Graphs
- Recontamination does not help to search a graph
This page was built for publication: Locating a robber with multiple probes
