Mobile search for a black hole in an anonymous ring
From MaRDI portal
Publication:996708
DOI10.1007/S00453-006-1232-ZzbMATH Open1123.68018OpenAlexW2755903365MaRDI QIDQ996708FDOQ996708
Authors: Stefan Dobrev, P. Flocchini, G. Prencipe, N. 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
Recommendations
Cited In (32)
- Black hole search in common interconnection networks
- Principles of Distributed Systems
- Searching for black holes in subways
- Fault-tolerant sequential scan
- Ping pong in dangerous graphs: optimal black hole search with pebbles
- Locating and repairing faults in a network with mobile agents
- Gathering of robots in a ring with mobile faults
- On location hiding in distributed systems
- Black hole search in directed graphs
- Synchronous black hole search in directed graphs
- Approximation bounds for Black Hole Search problems
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols
- Title not available (Why is that?)
- Explore and repair graphs with black holes using mobile entities
- Exploration of Faulty Hamiltonian Graphs
- Improved periodic data retrieval in asynchronous rings with a faulty host
- Exploring an unknown dangerous graph with a constant number of tokens
- Time optimal algorithms for black hole search in rings
- Time optimal algorithms for black hole search in rings
- Partial gathering of mobile agents in asynchronous unidirectional rings
- Tight bounds for black hole search with scattered agents in synchronous rings
- USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS
- Move-optimal partial gathering of mobile agents in asynchronous trees
- Treasure hunt with barely communicating agents
- Locating and Repairing Faults in a Network with Mobile Agents
- Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
- Periodic data retrieval problem in rings containing a malicious host (extended abstract)
- Black hole search with finite automata scattered in a synchronous torus
- Black hole search despite Byzantine agents
- Collusion attack from hubs in the blockchain offline channel network
- Identifying hostile nodes in networks using mobile agents
- Searching for a black hole in arbitrary networks, optimal mobile agent protocols
This page was built for publication: Mobile search for a black hole in an anonymous ring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q996708)
