scientific article
From MaRDI portal
Publication:2934641
zbMath1302.68216MaRDI QIDQ2934641
Tomasz Radzik, Andrzej Pelc, Xiaohui Zhang, Leszek Gąsieniec
Publication date: 18 December 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)
Related Items (10)
Memory Efficient Anonymous Graph Exploration ⋮ Move-optimal partial gathering of mobile agents in asynchronous trees ⋮ How to meet when you forget: log-space rendezvous in arbitrary graphs ⋮ Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots ⋮ Fast periodic graph exploration with constant memory ⋮ Map construction of unknown graphs by multiple agents ⋮ Time versus space trade-offs for rendezvous in trees ⋮ Remembering without memory: tree exploration by asynchronous oblivious robots ⋮ Black Hole Search in Directed Graphs ⋮ An Improved Strategy for Exploring a Grid Polygon
This page was built for publication:
