Periodic Data Retrieval Problem in Rings Containing a Malicious Host
From MaRDI portal
Publication:3569123
DOI10.1007/978-3-642-13284-1_13zbMath1284.68565OpenAlexW1574929671MaRDI QIDQ3569123
Rastislav Královič, Stanislav Miklík
Publication date: 17 June 2010
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13284-1_13
Graph theory (including graph drawing) in computer science (68R10) Agent technology and artificial intelligence (68T42)
Related Items
Improved periodic data retrieval in asynchronous rings with a faulty host ⋮ Exploring an unknown dangerous graph with a constant number of tokens ⋮ Ping pong in dangerous graphs: optimal black hole search with pebbles ⋮ Black Hole Search with Finite Automata Scattered in a Synchronous Torus