Pages that link to "Item:Q3057096"
From MaRDI portal
The following pages link to Searching symmetric networks with Utilitarian-Postman paths (Q3057096):
Displaying 10 items.
- Search for an immobile entity on a network (Q933506) (← links)
- A competitive search game with a moving target (Q2158054) (← links)
- Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
- Online failure diagnosis in interdependent networks (Q2226505) (← 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)
- Hide-and-seek games on a tree to which Eulerian networks are attached (Q3184601) (← links)
- Search games on networks with travelling and search costs and with arbitrary searcher starting points (Q5326807) (← links)
