Initial point search on weighted trees

DOI<821::AID-NAV3220410610>3.0.CO;2-Y 10.1002/1520-6750(199410)41:6<821::AID-NAV3220410610>3.0.CO;2-YzbMath0821.90140OpenAlexW2072156568MaRDI QIDQ4314865

William H. Ruckle, Kensaku Kikuta

Publication date: 1 December 1994

Full work available at URL: https://doi.org/10.1002/1520-6750(199410)41:6<821::aid-nav3220410610>3.0.co;2-y

zbMATH Keywords

weighted graphinitial point search game

Mathematics Subject Classification ID

Search theory (90B40) 2-person games (91A05) Games involving graphs (91A43)

Related Items (8)

Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object ⋮ Accumulation games. I: Noisy search ⋮ Search games on networks with travelling and search costs and with arbitrary searcher starting points ⋮ A proof of the Kikuta-Ruckle conjecture on cyclic caching of resources ⋮ Screening and hiding versus search ⋮ A new approach to Gal's theory of search games on weakly Eulerian networks ⋮ Search games on a network with travelling and search costs ⋮ Static search games played over graphs and general metric spaces

Cites Work

• Unnamed Item

This page was built for publication: Initial point search on weighted trees