Pages that link to "Item:Q3548722"

The following pages link to Approximation bounds for Black Hole Search problems (Q3548722):

Displaying 11 items.

• More agents may decrease global work: a case in butterfly decontamination (Q343925) (← links)
• 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)
• 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)
• Ping pong in dangerous graphs: optimal black hole search with pebbles (Q2429323) (← links)
• TIME OPTIMAL ALGORITHMS FOR BLACK HOLE SEARCH IN RINGS (Q2905278) (← links)
• Exploration of Faulty Hamiltonian Graphs (Q2970203) (← links)
• Black Hole Search with Finite Automata Scattered in a Synchronous Torus (Q3095347) (← links)