A graph search algorithm for indoor pursuit/evasion
From MaRDI portal
Publication:970034
DOI10.1016/J.MCM.2009.06.011zbMATH Open1185.91048OpenAlexW2033957624MaRDI QIDQ970034FDOQ970034
Athanasios Kehagias, Geoffrey Hollinger, Sanjiv Singh
Publication date: 8 May 2010
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2009.06.011
Graph algorithms (graph-theoretic aspects) (05C85) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Searching and pebbling
- Vertex-to-vertex pursuit in a graph
- A note on \(k\)-cop, \(l\)-robber games on graphs
- An annotated bibliography on guaranteed graph searching
- The complexity of searching a graph
- Recontamination does not help to search a graph
- Graph-Theoretic Concepts in Computer Science
- Delaunay refinement algorithms for triangular mesh generation
- Visibility-based pursuit-evasion in a polygonal environment
- Robot motion planning: A game-theoretic foundation
Cited In (6)
- Connected searching of weighted trees
- A unified and efficient solution to the room search problem
- Continuous graph partitioning for camera network surveillance
- The capture time of a planar graph
- Target encirclement of moving ride-hailing vehicle under uncertain environment: a multi-vehicle mutual rescue model
- On the Capture Time of Cops and Robbers Game on a Planar Graph
Uses Software
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)
