A general lower bound for collaborative tree exploration

DOI10.1007/978-3-319-72050-0_8zbMath1437.68204OpenAlexW2528604547MaRDI QIDQ5916000

Frank Mousset, Andreas Noever, Yann Disser, 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

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

Related Items (1)

Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next

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