Lower bound for the advantage coefficient in the search problem on graphs

DOI10.1134/S0012266108120136zbMath1175.90391MaRDI QIDQ1040813

Abdulla A. Azamov

Publication date: 26 November 2009

Published in: Differential Equations (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Differential games (aspects of game theory) (91A23) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Game with Slow Pursuers on the Edge Graphs of Regular Simplexes ⋮ Differential Game with Slow Pursuers on the Edge Graph of a Simplex ⋮ Linear evasion differential game of one evader and several pursuers with integral constraints ⋮ A pursuit-evasion differential game with slow pursuers on the edge graph of a simplex. I

Cites Work

• Optimal Algorithms for a Pursuit-Evasion Problem in Grids
• Unnamed Item

This page was built for publication: Lower bound for the advantage coefficient in the search problem on graphs