Publisher
Springer Nature Switzerland
Reference11 articles.
1. van den Akker, E., Buchin, K., Foerster, K.: Multi-agent online graph exploration on cycles and tadpole graphs. CoRR abs/2402.13845 (2024)
2. Brandt, S., Foerster, K., Maurer, J., Wattenhofer, R.: Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs. Theor. Comput. Sci. 839, 176–185 (2020)
3. Dereniowski, D., Disser, Y., Kosowski, A., Pajak, D., Uznanski, P.: Fast collaborative graph exploration. Inf. Comput. 243, 37–49 (2015)
4. Disser, Y., Mousset, F., Noever, A., Skoric, N., Steger, A.: A general lower bound for collaborative tree exploration. Theor. Comput. Sci. 811, 70–78 (2020)
5. Lecture Notes in Computer Science;M Dynia,2006