A pursuit-evasion differential game with slow pursuers on the edge graph of a simplex. I
From MaRDI portal
(Redirected from Publication:2069711)
Recommendations
Cites work
- scientific article; zbMATH DE number 6009880 (Why is no real title available?)
- scientific article; zbMATH DE number 3112450 (Why is no real title available?)
- scientific article; zbMATH DE number 3717164 (Why is no real title available?)
- scientific article; zbMATH DE number 1216995 (Why is no real title available?)
- scientific article; zbMATH DE number 3212886 (Why is no real title available?)
- scientific article; zbMATH DE number 3365084 (Why is no real title available?)
- A search problem on graphs which generalizes some group testing problems with two defectives
- A two-person game on graphs where each player tries to encircle his opponent's men
- An annotated bibliography on guaranteed graph searching
- Cop-win graphs with maximum capture-time
- Lower bound for the advantage coefficient in the search problem on graphs
- Multistage games with pairwise interactions on full graph
- Note on a pursuit game played on graphs
- On an alternative for pursuit-evasion games in an infinite time interval
- Search in graphs
- Spiele auf Graphen
- The capture time of a graph
- The game of cops and robbers on graphs
- The pursuit-evasion game on the 1-skeleton graph of the regular polyhedron. I
- Unsolved problems in combinatorial games
Cited in
(5)- Game with Slow Pursuers on the Edge Graphs of Regular Simplexes
- Differential Game with Slow Pursuers on the Edge Graph of a Simplex
- scientific article; zbMATH DE number 7349341 (Why is no real title available?)
- Cops and robber game on infinite chessboard
- scientific article; zbMATH DE number 4160528 (Why is no real title available?)
This page was built for publication: A pursuit-evasion differential game with slow pursuers on the edge graph of a simplex. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2069711)