Graph searching games with a radius of capture

MaRDI QIDQ3099720zbMATH OpenFDO

Authors Tatiana V. Abramovskaya, N. N. Petrov

Publication date 1 December 2011

zbMATH Keywords

\(\varepsilon\)-captureevaderGolovach functionguaranteed searchsearch numbersteam of pursuersunit jumps

Mathematics Subject Classification ID

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

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

Cited in

(3)

• Nontrivial discontinuities of the Golovach functions for trees
• On some problems of guaranteed search on graphs
• 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)