Mobile search for a black hole in an anonymous ring

DOI10.1007/S00453-006-1232-ZzbMath1123.68018OpenAlexW2755903365MaRDI QIDQ996708

Giuseppe Prencipe, Stefan Dobrev, Paola Flocchini, Nicola Santoro

Publication date: 19 July 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-006-1232-z

zbMATH Keywords

mobile agents

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (23)

Fault-tolerant sequential scan ⋮ Unnamed Item ⋮ TIME OPTIMAL ALGORITHMS FOR BLACK HOLE SEARCH IN RINGS ⋮ Move-optimal partial gathering of mobile agents in asynchronous trees ⋮ Tight bounds for black hole search with scattered agents in synchronous rings ⋮ Explore and repair graphs with black holes using mobile entities ⋮ Improved periodic data retrieval in asynchronous rings with a faulty host ⋮ Exploring an unknown dangerous graph with a constant number of tokens ⋮ Locating and Repairing Faults in a Network with Mobile Agents ⋮ Ping pong in dangerous graphs: optimal black hole search with pebbles ⋮ Partial gathering of mobile agents in asynchronous unidirectional rings ⋮ Exploration of Faulty Hamiltonian Graphs ⋮ Searching for a black hole in arbitrary networks: optimal mobile agents protocols ⋮ Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens ⋮ Collusion Attack from Hubs in The Blockchain Offline Channel Network ⋮ Gathering of robots in a ring with mobile faults ⋮ Approximation bounds for Black Hole Search problems ⋮ Locating and repairing faults in a network with mobile agents ⋮ Searching for black holes in subways ⋮ Synchronous black hole search in directed graphs ⋮ USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS ⋮ Black Hole Search with Finite Automata Scattered in a Synchronous Torus ⋮ Black Hole Search in Directed Graphs

This page was built for publication: Mobile search for a black hole in an anonymous ring