A search game on the union of graphs with immobile hider

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199512)42:8<1177::AID-NAV3220420805>3.0.CO;2-R" /><1177::AID-NAV3220420805>3.0.CO;2-R 10.1002/1520-6750(199512)42:8<1177::AID-NAV3220420805>3.0.CO;2-RzbMath0840.90146OpenAlexW2041047721MaRDI QIDQ4859575

Ljiljana Pavlović

Publication date: 1 February 1996

Full work available at URL: https://doi.org/10.1002/1520-6750(199512)42:8<1177::aid-nav3220420805>3.0.co;2-r

zbMATH Keywords

search gameimmobile hider

Mathematics Subject Classification ID

Search theory (90B40) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (8)

A competitive search game with a moving target ⋮ Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object ⋮ On the approximation ratio of the random Chinese postman tour for network search ⋮ Network search games with immobile hider, without a designated searcher starting point ⋮ The expanding search ratio of a graph ⋮ A new approach to Gal's theory of search games on weakly Eulerian networks ⋮ Search for an immobile hider on a stochastic network ⋮ Static search games played over graphs and general metric spaces

This page was built for publication: A search game on the union of graphs with immobile hider