Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
From MaRDI portal
Publication:3523202
DOI10.1007/978-3-540-75142-7_11zbMath1145.68347OpenAlexW1600210399MaRDI QIDQ3523202
Jérémie Chalopin, Shantanu Das, Nicola Santoro
Publication date: 2 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75142-7_11
Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (11)
Beyond Rings: Gathering in 1-Interval Connected Graphs ⋮ Tight bounds for black hole search with scattered agents in synchronous rings ⋮ Improved periodic data retrieval in asynchronous rings with a faulty host ⋮ Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty ⋮ Ping pong in dangerous graphs: optimal black hole search with pebbles ⋮ Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens ⋮ Gathering of robots in a ring with mobile faults ⋮ Searching for black holes in subways ⋮ Mobile Agent Rendezvous in a Ring Using Faulty Tokens ⋮ Gathering in dynamic rings ⋮ Black Hole Search with Finite Automata Scattered in a Synchronous Torus
This page was built for publication: Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
