Pages that link to "Item:Q2382674"
From MaRDI portal
The following pages link to Hardness and approximation results for black hole search in arbitrary networks (Q2382674):
Displaying 12 items.
- Tight bounds for black hole search with scattered agents in synchronous rings (Q392196) (← links)
- Searching for black holes in subways (Q692936) (← links)
- Exploring an unknown dangerous graph with a constant number of tokens (Q896695) (← links)
- Locating and repairing faults in a network with mobile agents (Q962168) (← links)
- Gathering of robots in a ring with mobile faults (Q1731510) (← links)
- Ping pong in dangerous graphs: optimal black hole search with pebbles (Q2429323) (← links)
- Exploration of Faulty Hamiltonian Graphs (Q2970203) (← links)
- Black Hole Search with Finite Automata Scattered in a Synchronous Torus (Q3095347) (← links)
- Locating and Repairing Faults in a Network with Mobile Agents (Q3511386) (← links)
- Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens (Q3540233) (← links)
- Approximation bounds for Black Hole Search problems (Q3548722) (← links)
- Black hole search despite Byzantine agents (Q6536342) (← links)
