Black Hole Search with Finite Automata Scattered in a Synchronous Torus
From MaRDI portal
Publication:3095347
DOI10.1007/978-3-642-24100-0_41zbMath1254.68053arXiv1106.6037OpenAlexW1910061521MaRDI QIDQ3095347
Arnaud Labourel, Shantanu Das, Jérémie Chalopin, Euripides Markou
Publication date: 28 October 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1106.6037
distributed algorithmsmobile agentsfinite state automataanonymous networksblack hole searchidentical tokens
Related Items (2)
Exploring an unknown dangerous graph with a constant number of tokens ⋮ Black Hole Search with Finite Automata Scattered in a Synchronous Torus
Cites Work
- Deterministic symmetric rendezvous with tokens in a synchronous torus
- Mobile search for a black hole in an anonymous ring
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols
- Hardness and approximation results for black hole search in arbitrary networks
- Black Hole Search with Finite Automata Scattered in a Synchronous Torus
- Black Hole Search in Directed Graphs
- Collective tree exploration
- Black Hole Search in Asynchronous Rings Using Tokens
- Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
- Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
- Approximation bounds for Black Hole Search problems
- Periodic Data Retrieval Problem in Rings Containing a Malicious Host
- USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS
- Exploring an unknown graph
- Structural Information and Communication Complexity
- Searching for a Black Hole in Synchronous Tree Networks
- Principles of Distributed Systems
- Black hole search in common interconnection networks
This page was built for publication: Black Hole Search with Finite Automata Scattered in a Synchronous Torus
