Pages that link to "Item:Q1377669"
From MaRDI portal
The following pages link to Complexity of searching an immobile hider in a graph (Q1377669):
Displaying 15 items.
- Scheduling search procedures: The wheel of fortune (Q880568) (← 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)
- Ranking hypotheses to minimize the search cost in probabilistic inference models (Q1025988) (← links)
- Search-hide games on trees (Q1129971) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- Searching for an evader in an unknown graph by an optimal number of searchers (Q2007918) (← links)
- A competitive search game with a moving target (Q2158054) (← links)
- Search for an immobile hider on a stochastic network (Q2286995) (← links)
- Search Games: A Review (Q2961390) (← links)
- Searching symmetric networks with Utilitarian-Postman paths (Q3057096) (← links)
- Technical Note—The Complexity of the Optimal Searcher Path Problem (Q4724426) (← links)
- A search game on the union of graphs with immobile hider (Q4859575) (← links)
- On Submodular Search and Machine Scheduling (Q5108249) (← links)
- Searching a Variable Speed Network (Q5244863) (← links)