Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents

Yann Disser, Jan Hackfeld, Max Klimm. Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents. Journal of the ACM, 66(6), 2019. [doi]

Authors

Yann Disser

This author has not been identified. Look up 'Yann Disser' in Google

Jan Hackfeld

This author has not been identified. Look up 'Jan Hackfeld' in Google

Max Klimm

This author has not been identified. Look up 'Max Klimm' in Google