A search game on the union of graphs with immobile hider
From MaRDI portal
Publication:4859575
DOI10.1002/1520-6750(199512)42:8%3C1177::AID-NAV3220420805%3E3.0.CO;2-RzbMATH Open0840.90146OpenAlexW2041047721MaRDI QIDQ4859575FDOQ4859575
Authors: Ljiljana Pavlović 
Publication date: 1 February 1996
Full work available at URL: https://doi.org/10.1002/1520-6750(199512)42:8%3C1177::aid-nav3220420805%3E3.0.co;2-r
Recommendations
- scientific article; zbMATH DE number 464828
- The search game on a network with immobile hider
- Complexity of searching an immobile hider in a graph
- A search game on a hypergraph with booby traps
- The domination game played on unions of graphs
- A search game on a cyclic graph
- Fugitive-search games on graphs and related parameters
- Fugitive-search games on graphs and related parameters
- Hide-and-seek games on a network, using combinatorial search paths
- Static search games played over graphs and general metric spaces
Search theory (90B40) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Cited In (12)
- A new approach to Gal's theory of search games on weakly Eulerian networks
- The expanding search ratio of a graph
- Search for an immobile hider on a stochastic network
- Title not available (Why is that?)
- A Linear Programming Approach to the Search Game on a Network with Mobile Hider
- Network search games with immobile hider, without a designated searcher starting point
- Complexity of searching an immobile hider in a graph
- A competitive search game with a moving target
- Title not available (Why is that?)
- On the approximation ratio of the random Chinese postman tour for network search
- Optimal trade-off between speed and acuity when searching for a small object
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4859575)
