Locating and repairing faults in a network with mobile agents
From MaRDI portal
Publication:962168
DOI10.1016/j.tcs.2010.01.011zbMath1191.68722OpenAlexW2132927293MaRDI QIDQ962168
Tomasz Radzik, Ralf Klasing, Colin Cooper
Publication date: 6 April 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.01.011
Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Agent technology and artificial intelligence (68T42)
Related Items (8)
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane ⋮ Tight bounds for black hole search with scattered agents in synchronous rings ⋮ Explore and repair graphs with black holes using mobile entities ⋮ Black Virus Decontamination of Synchronous Ring Networks by Initially Scattered Mobile Agents ⋮ Exploring an unknown dangerous graph with a constant number of tokens ⋮ Exploration of Faulty Hamiltonian Graphs ⋮ Gathering of robots in a ring with mobile faults ⋮ Synchronous black hole search in directed graphs
Cites Work
- Mobile search for a black hole in an anonymous ring
- \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
- A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree
- A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols
- Hardness and approximation results for black hole search in arbitrary networks
- Collective tree exploration
- Black Hole Search in Asynchronous Rings Using Tokens
- Locating and Repairing Faults in a Network with Mobile Agents
- Approximation bounds for Black Hole Search problems
- Performing Work Efficiently in the Presence of Faults
- Randomization helps to perform independent tasks reliably
- Searching for a Black Hole in Synchronous Tree Networks
- Black hole search in common interconnection networks
- Principles of Distributed Systems
This page was built for publication: Locating and repairing faults in a network with mobile agents
