Searching and sweeping graphs: a brief survey
From MaRDI portal
Publication:3418339
zbMATH Open1195.05019MaRDI QIDQ3418339FDOQ3418339
Authors: Brian Alspach 
Publication date: 2 February 2007
Recommendations
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (74)
- The one-cop-moves game on graphs with some special structures
- Fast Robber in Planar Graphs
- Distributed graph searching with a sense of direction
- A Combinatorial Model of Two-Sided Search
- Distributed Evacuation in Graphs with Multiple Exits
- Title not available (Why is that?)
- The object detection by autonomous apparatus as a solution of the Buffon needle problem
- Connected search for a lazy robber
- Edge degeneracy: algorithmic and structural results
- Constrained graph searching on trees
- Edge searching and fast searching with constraints
- Monotonicity in digraph search problems
- The optimal capture time of the one-cop-moves game
- Guard games on graphs: keep the intruder out!
- How to guard a graph?
- Connected searching of weighted trees
- Vertex Pursuit Games in Stochastic Network Models
- Pursuing a fast robber on a graph
- A witness version of the cops and robber game
- Digraphs of Bounded Width
- Almost all cop-win graphs contain a universal vertex
- A tight lower bound for the capture time of the cops and robbers game
- An annotated bibliography on guaranteed graph searching
- Algorithms and Computation
- Searching for a Visible, Lazy Fugitive
- The capture time of a graph
- Safe navigation in adversarial environments
- Searching for an intruder on graphs and their subdivisions
- The capture time of a planar graph
- Digraph Decompositions and Monotonicity in Digraph Searching
- A graph search algorithm for indoor pursuit/evasion
- Bounding the search number of graph products
- Chasing robbers on random graphs: zigzag theorem
- Cops and invisible robbers: the cost of drunkenness
- Time constrained graph searching
- Some remarks on cops and drunk robbers
- Cleaning a network with brushes
- Parallel cleaning of a network with brushes
- Parameterized pursuit-evasion games
- Strong-mixed searching and pathwidth
- Digraph searching, directed vertex separation and directed pathwidth
- Variations of cops and robbers game on grids
- Conjectures on Cops and Robbers
- Sweeping graphs with large clique number
- Chasing robbers on random geometric graphs-an alternative approach
- Cops and robber on butterflies and solid grids
- The capture time of grids
- Visibility graphs, dismantlability, and the cops and robbers game
- Cop-win graphs with maximum capture-time
- Fast searching on cactus graphs
- Cops and robber game without recharging
- Fast Searching on Complete k-partite Graphs
- Lower bounds on the pathwidth of some grid-like graphs
- Meyniel's conjecture holds for random graphs
- The fast search number of a complete \(k\)-partite graph
- Variations on cops and robbers
- On Meyniel's conjecture of the cop number
- Cops and robber on some families of oriented graphs
- Control Sequencing in a Game of Identity Pursuit-Evasion
- Digraph decompositions and monotonicity in digraph searching
- Guarding a subgraph as a tool in pursuit-evasion games
- Linguistic geometry approach for solving the cops and robber problem in grid environments
- On the Conjecture of the Smallest 3-Cop-Win Planar Graph
- Cops and robbers from a distance
- Locating a robber on a graph via distance queries
- Contiguous search problem in Sierpiński graphs
- On the Capture Time of Cops and Robbers Game on a Planar Graph
- Search and sweep numbers of finite directed acyclic graphs
- Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond
- Zero-visibility cops and robber and the pathwidth of a graph
- To satisfy impatient web surfers is hard
- Large classes of infinite \(k\)-cop-win graphs
- The fast search number of a Cartesian product of graphs
- The guarding game is E-complete
This page was built for publication: Searching and sweeping graphs: a brief survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3418339)
