Exploring an unknown dangerous graph using tokens
From MaRDI portal
Publication:1939252
DOI10.1016/j.tcs.2012.11.022zbMath1259.68159OpenAlexW2066234959MaRDI QIDQ1939252
Nicola Santoro, Stefan Dobrev, Rastislav Královič, Paola Flocchini
Publication date: 4 March 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.11.022
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Agent technology and artificial intelligence (68T42)
Related Items (8)
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane ⋮ Distributed exploration of dynamic rings ⋮ Tight bounds for black hole search with scattered agents in synchronous rings ⋮ Explore and repair graphs with black holes using mobile entities ⋮ Exploring an unknown dangerous graph with a constant number of tokens ⋮ Exploration of Faulty Hamiltonian Graphs ⋮ Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens ⋮ Synchronous robots vs asynchronous lights-enhanced robots on graphs
This page was built for publication: Exploring an unknown dangerous graph using tokens
