scientific article; zbMATH DE number 2119714

zbMATH Open1093.68615MaRDI QIDQ4828987FDOQ4828987

Authors: Krzysztof Diks, Pierre Fraigniaud, Andrzej Pelc, Evangelos Kranakis 

Publication date: 29 November 2004

Title of this publication is not available (Why is that?)

Recommendations

• Tree exploration with little memory
• Tree exploration with logarithmic memory
• Tree exploration with logarithmic memory
• Graph exploration by a finite automaton
• Mathematical Foundations of Computer Science 2004

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)

Cited In (14)

• Black hole search in common interconnection networks
• Tree Exploration with an Oracle
• Remembering without memory: tree exploration by asynchronous oblivious robots
• Tree exploration with logarithmic memory
• Optimal graph exploration without good maps
• Tree exploration with little memory
• Labeling schemes for tree representation
• Structural Information and Communication Complexity
• STACS 2004
• Searching without communicating: tradeoffs between performance and selection complexity
• Collective tree exploration
• Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
• Distributed chasing of network intruders
• Tree exploration with logarithmic memory

This page was built for publication:

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