The localization capture time of a graph
From MaRDI portal
Publication:2118876
DOI10.1016/j.tcs.2022.02.007OpenAlexW4213346774MaRDI QIDQ2118876
Brittany Pittman, Natalie C. Behague, Melissa Huggan, Trent G. Marbach, Anthony Bonato
Publication date: 23 March 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.09806
projective planestreewidthtreespathwidthlocalization gamelocalization numberlocalization capture time
Related Items (4)
The one-visibility localization game ⋮ The localization game on oriented graphs ⋮ Edge and pair queries-random graphs and complexity ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Centroidal localization game
- Locating a robber on a graph
- Bounds on the length of a game of cops and robbers
- An annotated bibliography on guaranteed graph searching
- The capture time of a graph
- On the cop number of a graph
- Localization game on geometric and planar graphs
- A note on the localization number of random graphs: diameter two case
- Locating a robber on a graph via distance queries
- Localization game for random graphs
- A tight lower bound for the capture time of the cops and robbers game
- The localization game on Cartesian products
- The game of overprescribed Cops and Robbers played on graphs
- A robber locating strategy for trees
- Locating a robber with multiple probes
- Locating a backtracking robber on a tree
- Monotonicity in graph searching
- Graph Classes: A Survey
- Recontamination does not help to search a graph
This page was built for publication: The localization capture time of a graph
