A graph search algorithm for indoor pursuit/evasion
From MaRDI portal
Publication:970034
Recommendations
Cites work
- scientific article; zbMATH DE number 3590298 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- A note on \(k\)-cop, \(l\)-robber games on graphs
- An annotated bibliography on guaranteed graph searching
- Delaunay refinement algorithms for triangular mesh generation
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Recontamination does not help to search a graph
- Robot motion planning: A game-theoretic foundation
- Searching and pebbling
- Searching and sweeping graphs: a brief survey
- Searching is not jumping.
- The complexity of searching a graph
- Vertex-to-vertex pursuit in a graph
- Visibility-based pursuit-evasion in a polygonal environment
Cited in
(7)- The capture time of a planar graph
- A unified and efficient solution to the room search problem
- On the Capture Time of Cops and Robbers Game on a Planar Graph
- Continuous graph partitioning for camera network surveillance
- Intruder alert! Optimization models for solving the mobile robot graph-clear problem
- Connected searching of weighted trees
- Target encirclement of moving ride-hailing vehicle under uncertain environment: a multi-vehicle mutual rescue model
This page was built for publication: A graph search algorithm for indoor pursuit/evasion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970034)