Initial point search on weighted trees

DOI10.1002/1520-6750(199410)41:6%3C821::AID-NAV3220410610%3E3.0.CO;2-YzbMATH Open0821.90140OpenAlexW2072156568MaRDI QIDQ4314865FDOQ4314865

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%3C821::aid-nav3220410610%3E3.0.co;2-y

Recommendations

• A SEARCH GAME WITH TRAVELING COST ON A TREE
• Connected searching of weighted trees
• Weighted search games
• Search games on networks with travelling and search costs and with arbitrary searcher starting points
• Ambush Strategies in Search Games on Graphs

zbMATH Keywords

weighted graphinitial point search game

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Cited In (8)

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

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

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