Graph searching games with a radius of capture

zbMATH Open1229.90068MaRDI QIDQ3099720FDOQ3099720

N. N. Petrov, Tatiana V. Abramovskaya

Publication date: 1 December 2011

zbMATH Keywords

evaderGolovach functionguaranteed searchsearch numbersteam of pursuersunit jumps\(\varepsilon\)-capture

Mathematics Subject Classification ID

Search theory (90B40) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

   Recommendations

• On some problems of guaranteed search on graphs 👍 👎
• Arbitrarily large jumps of the Golovach function for trees 👍 👎
• Nontrivial discontinuities of the Golovach functions for trees 👍 👎
• On certain search problems with counteraction. 👍 👎
• Monotonicity of the search number in the Golovach problem 👍 👎

This page was built for publication: Graph searching games with a radius of capture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3099720)