Pages that link to "Item:Q4859575"
From MaRDI portal
The following pages link to A search game on the union of graphs with immobile hider (Q4859575):
Displaying 10 items.
- A new approach to Gal's theory of search games on weakly Eulerian networks (Q692087) (← links)
- Network search games with immobile hider, without a designated searcher starting point (Q933761) (← links)
- Complexity of searching an immobile hider in a graph (Q1377669) (← links)
- On the approximation ratio of the random Chinese postman tour for network search (Q1694817) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- A competitive search game with a moving target (Q2158054) (← links)
- Search for an immobile hider on a stochastic network (Q2286995) (← links)
- Static search games played over graphs and general metric spaces (Q2356189) (← links)
- Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object (Q3195234) (← links)
- A Linear Programming Approach to the Search Game on a Network with Mobile Hider (Q4016756) (← links)