Pages that link to "Item:Q692087"
From MaRDI portal
The following pages link to A new approach to Gal's theory of search games on weakly Eulerian networks (Q692087):
Displayed 7 items.
- On the approximation ratio of the random Chinese postman tour for network search (Q1694817) (← links)
- Social distancing, gathering, search games: mobile agents on simple networks (Q2128973) (← links)
- Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← 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)
- Codes, lower bounds, and phase transitions in the symmetric rendezvous problem (Q2953697) (← links)
- Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object (Q3195234) (← links)