Pages that link to "Item:Q5437234"
From MaRDI portal
The following pages link to Searching for a Black Hole in Synchronous Tree Networks (Q5437234):
Displayed 17 items.
- Tight bounds for black hole search with scattered agents in synchronous rings (Q392196) (← links)
- Searching for black holes in subways (Q692936) (← links)
- Synchronous black hole search in directed graphs (Q719316) (← links)
- Fault-tolerant sequential scan (Q841615) (← links)
- Explore and repair graphs with black holes using mobile entities (Q888441) (← 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)
- Hardness and approximation results for black hole search in arbitrary networks (Q2382674) (← links)
- Computing without communicating: ring exploration by asynchronous oblivious robots (Q2392925) (← links)
- Ping pong in dangerous graphs: optimal black hole search with pebbles (Q2429323) (← links)
- TIME OPTIMAL ALGORITHMS FOR BLACK HOLE SEARCH IN RINGS (Q2905278) (← links)
- EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN (Q2929616) (← links)
- Exploration of Faulty Hamiltonian Graphs (Q2970203) (← links)
- Black Hole Search with Finite Automata Scattered in a Synchronous Torus (Q3095347) (← links)
- Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens (Q3540233) (← links)
- Approximation bounds for Black Hole Search problems (Q3548722) (← links)
- USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS (Q3606553) (← links)