Game with Slow Pursuers on the Edge Graphs of Regular Simplexes
From MaRDI portal
Publication:5057950
DOI10.1007/978-3-030-93616-7_2zbMath1504.91035OpenAlexW4237644521MaRDI QIDQ5057950
Gafurjan I. Ibragimov, Tolanbay Ibaydullaev, Abdulla A. Azamov
Publication date: 1 December 2022
Published in: Trends in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-93616-7_2
Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Note on a pursuit game played on graphs
- 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
- The capture time of a graph
- On an alternative for pursuit-evasion games in an infinite time interval
- Spiele auf Graphen
- 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
- On a characterization of evasion strategies for pursuit-evasion games on graphs
- The pursuit-evasion game on the 1-skeleton graph of a regular polyhedron. II
- The pursuit-evasion game on the 1-skeleton graph of a regular polyhedron. I
- High-order necessary optimality conditions in a linear maxmin problem with coupled variables
This page was built for publication: Game with Slow Pursuers on the Edge Graphs of Regular Simplexes