Pages that link to "Item:Q933761"
From MaRDI portal
The following pages link to Network search games with immobile hider, without a designated searcher starting point (Q933761):
Displaying 16 items.
- Infrastructure security games (Q297288) (← links)
- Search for an immobile entity on a network (Q933506) (← links)
- On the approximation ratio of the random Chinese postman tour for network search (Q1694817) (← links)
- Continuous patrolling and hiding games (Q1735165) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- A competitive search game with a moving target (Q2158054) (← links)
- Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
- Search and rescue in the face of uncertain threats (Q2184077) (← links)
- Search for an immobile hider on a stochastic network (Q2286995) (← links)
- Search for an immobile hider in a known subset of a network (Q2328862) (← links)
- Search games on a network with travelling and search costs (Q2349413) (← links)
- Static search games played over graphs and general metric spaces (Q2356189) (← links)
- Search Games: A Review (Q2961390) (← 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)
