Black Hole Search in Asynchronous Rings Using Tokens
From MaRDI portal
Recommendations
- Time optimal algorithms for black hole search in rings
- Time optimal algorithms for black hole search in rings
- Tight bounds for black hole search with scattered agents in synchronous rings
- Synchronous black hole search in directed graphs
- Black hole search with finite automata scattered in a synchronous torus
- USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS
Cited in
(14)- Exploring an unknown dangerous graph using tokens
- Ping pong in dangerous graphs: optimal black hole search with pebbles
- Black hole search with finite automata scattered in a synchronous torus
- Locating and Repairing Faults in a Network with Mobile Agents
- Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
- USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS
- Tight bounds for black hole search with scattered agents in synchronous rings
- scientific article; zbMATH DE number 2006651 (Why is no real title available?)
- Improved periodic data retrieval in asynchronous rings with a faulty host
- Black hole search despite Byzantine agents
- Team formation and applications
- 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
This page was built for publication: Black Hole Search in Asynchronous Rings Using Tokens
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434551)