Undirected Graph Exploration with ⊝(log log n) Pebbles

DOI10.1137/1.9781611974331.ch3zbMath1410.68295OpenAlexW4238529886MaRDI QIDQ4575577

Yann Disser, Jan Hackfeld, Max Klimm

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Unnamed Item ⋮ A tight lower bound for semi-synchronous collaborative grid exploration ⋮ A general lower bound for collaborative tree exploration ⋮ A tight lower bound for semi-synchronous collaborative grid exploration

This page was built for publication: Undirected Graph Exploration with ⊝(log log n) Pebbles