The following pages link to Search games with immobile hider (Q2366102):
Displayed 16 items.
- A new approach to Gal's theory of search games on weakly Eulerian networks (Q692087) (← links)
- Search for an immobile entity on a network (Q933506) (← links)
- Network search games with immobile hider, without a designated searcher starting point (Q933761) (← 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)
- Approximate solutions for expanding search games on general networks (Q2327672) (← links)
- Search for an immobile hider in a known subset of a network (Q2328862) (← links)
- Static search games played over graphs and general metric spaces (Q2356189) (← links)
- Search Games for an Immobile Hider (Q2961391) (← links)
- Searching symmetric networks with Utilitarian-Postman paths (Q3057096) (← links)
- Hide-and-seek games on a tree to which Eulerian networks are attached (Q3184601) (← links)
- Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object (Q3195234) (← links)
- Zero-Sum Two Person Games (Q5149734) (← links)
- Searching a Variable Speed Network (Q5244863) (← links)