Pages that link to "Item:Q4860667"
From MaRDI portal
The following pages link to A SEARCH GAME WITH TRAVELING COST ON A TREE (Q4860667):
Displayed 7 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)
- Search games on a network with travelling and search costs (Q2349413) (← links)
- Searching symmetric networks with Utilitarian-Postman paths (Q3057096) (← links)
- Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object (Q3195234) (← links)
- Searching a Variable Speed Network (Q5244863) (← links)
- Search games on networks with travelling and search costs and with arbitrary searcher starting points (Q5326807) (← links)