A general lower bound for collaborative tree exploration

DOI10.1007/978-3-319-72050-0_8MaRDI QIDQ5916000zbMATH OpenOpenAlexFDO

Authors Y. Disser, Frank Mousset, Andreas Noever, Nemanja Škorić, Angelika Steger

Publication date 12 April 2018

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/20.500.11850/221434

Mathematics Subject Classification ID

Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40) Online algorithms; streaming algorithms (68W27)

Recommendations

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

Cited in

(6)

• Fast collaborative graph exploration
• A tight lower bound for semi-synchronous collaborative grid exploration
• Fast collaborative graph exploration
• A general lower bound for collaborative tree exploration
• Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next
• Energy constrained depth first search

This page was built for publication: A general lower bound for collaborative tree exploration

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