Lower bound for the advantage coefficient in the search problem on graphs
Абдулла АзамовInstitute for Mathematics, Academy of Sciences, Tashkent, Uzbekistan
ABI
Abstract
We obtain a lower bound for the pursuing (searching) point velocity for which the minimax dynamic graph search problem in N.N. Petrov’s setting is solvable.
Topics
Identifiers
Citations and references
Metrics — AkademScholar · Coming soon