Graph Searching and Related Problems
Explore this paper's citation graph
Summary
A survey of the major results of graph searching problems, focusing on algorithmic, structural, and probabilistic aspects of the field.
- Type
- article
- Published
- 2013-01-01
- Cited by
- 39
- References
- 175
- Access
- Open access
- OpenAlex
- https://openalex.org/W33291493
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:16355165
Keywords
Graph, Null graph, Probabilistic logic, Combinatorics, Computer science
References
- A course on the Web graph
- Random Graphs: Second Edition
- Treewidth
- A Cover-Based Approach to Multi-Agent Moving Target Pursuit
- The Game of Cops and Robbers on Graphs
- Random Graphs: Notation
- The Mathematics of Paul Erdős II
- On Meyniel's conjecture of the cop number
- SEARCHING AND SWEEPING GRAPHS: A BRIEF SURVEY
- Evaluating Strategies for Running from the Cops
- The Cops & Robber game on series-parallel graphs
- Variations on cops and robbers
- On the Complexity of the Balanced Vertex Ordering Problem
- Optimal Algorithms for a Pursuit-Evasion Problem in Grids
- Classes of pebble games and complete problems
- Directed Path-width and Monotonicity in Digraph Searching
- A family of countable homogeneous graphs
- Cops and Robbers from a distance
- Digraph measures: Kelly decompositions, games, and orderings
- On the evolution of random graphs
Cited by
- The optimal capture time of the one-cop-moves game
- The fast robber on interval and chordal graphs
- Cops-and-robbers: Remarks and problems
- The role of quantum correlations in Cop and Robber game
- Algorithmic complexity: Between Structure and Knowledge How Pursuit-evasion Games help. (Complexité algorithmique: entre structure et connaissance. Comment les jeux de poursuite peuvent apporter des solutions)
- The fast search number of a Cartesian product of graphs
- A Tight Lower Bound for the Capture Time of the Cops and Robbers Game
- Hyperopic Cops and Robbers
- Bounds on the localization number
- Equivalence between Linear Tangle and Maximal Single Ideal
- A Sublinear Bound on the Cop Throttling Number of a Graph
- Guarding a Subgraph as a Tool in Pursuit-Evasion Games
- The Chinese deliveryman problem
- The localization number of designs
- The localization number and metric dimension of graphs of diameter 2
- The one-cop-moves game on graphs with some special structures
- Lower Bounds and Algorithms for Searching Networks
- A simple method for proving lower bounds in the zero-visibility cops and robber game
- Searching for an Intruder on Graphs and Their Subdivisions
- The localization capture time of a graph
Related papers
- The Game of Cops and Robbers on Graphs
- Vertex-to-vertex pursuit in a graph
- An annotated bibliography on guaranteed graph searching
- A game of cops and robbers
- Cops and robbers in graphs with large girth and Cayley graphs
- On Meyniel's conjecture of the cop number
- Cops and Robbers is EXPTIME-complete
- The capture time of a graph