The localization capture time of a graph

DOI10.1016/J.TCS.2022.02.007OpenAlexW4213346774MaRDI QIDQ2118876FDOQ2118876

Authors: Natalie C. Behague, Melissa Huggan, Trent Gregory Marbach, Brittany Pittman, 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

zbMATH Keywords

treestreewidthpathwidthprojective planeslocalization gamelocalization numberlocalization capture time

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Graph Classes: A Survey
• The capture time of a graph
• On the cop number of a graph
• The game of cops and robbers on graphs
• An annotated bibliography on guaranteed graph searching
• Title not available (Why is that?)
• Recontamination does not help to search a graph
• Monotonicity in graph searching
• Locating a robber on a graph via distance queries
• Locating a robber on a graph
• Locating a robber with multiple probes
• Locating a backtracking robber on a tree
• Centroidal localization game
• Bounds on the length of a game of cops and robbers
• Localization game on geometric and planar graphs
• A robber locating strategy for trees
• The game of overprescribed Cops and Robbers played on graphs
• Localization game for random graphs
• The localization game on Cartesian products
• A note on the localization number of random graphs: diameter two case
• A tight lower bound for the capture time of the cops and robbers game

Cited In (5)

• The localization game on oriented graphs
• The localization capture time of a graph
• The one-visibility localization game
• Edge and pair queries-random graphs and complexity
• Title not available (Why is that?)

This page was built for publication: The localization capture time of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118876)