Tree exploration with logarithmic memory

zbMATH Open1302.68216MaRDI QIDQ2934641FDOQ2934641

Authors: Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang, Leszek Gąsieniec 

Publication date: 18 December 2014

Recommendations

• Tree exploration with logarithmic memory
• scientific article; zbMATH DE number 2119714
• Tree exploration with little memory
• STACS 2004
• Tree Exploration with an Oracle

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)

Cited In (16)

• Time versus space trade-offs for rendezvous in trees
• Title not available (Why is that?)
• Map construction of unknown graphs by multiple agents
• Tree Exploration with an Oracle
• Tree exploration with advice
• Remembering without memory: tree exploration by asynchronous oblivious robots
• An improved strategy for exploring a grid polygon
• Black hole search in directed graphs
• Memory Efficient Anonymous Graph Exploration
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• Fast periodic graph exploration with constant memory
• Tree exploration with little memory
• STACS 2004
• Move-optimal partial gathering of mobile agents in asynchronous trees
• Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
• Impact of memory size on graph exploration capability

This page was built for publication: Tree exploration with logarithmic memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934641)