Fast collaborative graph exploration

DOI10.1007/978-3-642-39212-2_46MaRDI QIDQ5327462zbMATH OpenOpenAlexFDO

Authors Dariusz Dereniowski, Y. Disser, Adrian Kosowski, Dominik Pajak, Przemysław Uznański

Publication date 7 August 2013

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-00802308/file/collectiveExploration.pdf

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Fast collaborative graph exploration
• A general lower bound for collaborative tree exploration
• A general lower bound for collaborative tree exploration
• LATIN 2004: Theoretical Informatics
• Collective tree exploration

Cited in

(14)

• Balanced parallel exploration of orthogonal regions
• Minimizing the cost of team exploration
• Fast collaborative graph exploration
• Using a collective of agents for exploration of undirected graphs
• A tight lower bound for semi-synchronous collaborative grid exploration
• Exploration of Time-Varying Connected Graphs with Silent Agents
• Structural Information and Communication Complexity
• A general lower bound for collaborative tree exploration
• Fault-tolerant dispersion of mobile robots
• Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next
• Efficient graph exploration
• Collective tree exploration via potential function method
• Strategies for parallel unaware cleaners
• Setting port numbers for fast graph exploration

This page was built for publication: Fast collaborative graph exploration

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