Locating a backtracking robber on a tree

DOI10.1016/j.tcs.2014.04.019zbMath1358.05189OpenAlexW1973204071MaRDI QIDQ2453120

Suzanne M. Seager

Publication date: 6 June 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.04.019

zbMATH Keywords

cops and robbersmetric dimensiongraph searchinggraph location

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (18)

Localization game on geometric and planar graphs ⋮ Subdivisions in the robber locating game ⋮ Approximately locating an invisible agent in a graph with relative distance queries ⋮ A robber locating strategy for trees ⋮ Locating a robber with multiple probes ⋮ The one-visibility localization game ⋮ Edge and pair queries-random graphs and complexity ⋮ The localization number of designs ⋮ The cat and the noisy mouse ⋮ Unnamed Item ⋮ A note on the localization number of random graphs: diameter two case ⋮ Centroidal localization game ⋮ The localization game on Cartesian products ⋮ The robber locating game ⋮ Sequential metric dimension ⋮ Localization game for random graphs ⋮ Localization game for random geometric graphs ⋮ The localization capture time of a graph

Cites Work

• Locating a robber on a graph
• Vertex-to-vertex pursuit in a graph
• Locating a robber on a graph via distance queries
• A robber locating strategy for trees
• On the Metric Dimension of Cartesian Products of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Locating a backtracking robber on a tree