Almost discrete search programs on graphs
From MaRDI portal
Recommendations
Cited in
(7)- Note on a helicopter search problem on graphs
- Discrete search programs on graphs
- Some results about pursuit games on metric spaces obtained through graph theory techniques
- An almost-greedy search on random binary vectors and random graphs
- Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem
- Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs
- An annotated bibliography on guaranteed graph searching
This page was built for publication: Almost discrete search programs on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1422743)