A general lower bound for collaborative tree exploration

Yann Disser, Frank Mousset, Andreas Noever +2

We consider collaborative graph exploration with a set of $k$ agents. All agents start at a common vertex of an initially unknown graph and need to collectively visit all other ver…