The following pages link to Competitive search in a network (Q2184175):
Displaying 13 items.
- Flood search under the California split rule. (Q1426720) (← links)
- On the approximation ratio of the random Chinese postman tour for network search (Q1694817) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- A competitive search game with a moving target (Q2158054) (← links)
- Online routing and searching on graphs with blocked edges (Q2165266) (← 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)
- Competition and networks of collaboration (Q4612464) (← links)
- Mining Coal or Finding Terrorists: The Expanding Search Paradigm (Q5301126) (← links)
- The faulty Satnav (GPS) problem: search for home in networks with unreliable directions (Q6076348) (← links)
- Weighted online search (Q6133641) (← links)
- Optimal linear tracking for a hidden target on one of \(K\)-intervals (Q6151244) (← links)
- A study on the existence of a cooperative search method with reducing the first metting time between one of several nano-sensors and a Brownian particle (Q6537117) (← links)