Tight bounds for undirected graph exploration with pebbles and multiple agents

Disser, Y.; Hackfeld, J.; Klimm, M.

by Disser, Y., Hackfeld, J. and Klimm, M.

Reference:

Tight bounds for undirected graph exploration with pebbles and multiple agents (Disser, Y., Hackfeld, J. and Klimm, M.), In Journal of the ACM, volume 66, 2019.

Bibtex Entry:

@article{DisserHackfeldKlimm-19,
 author = {Disser, Y. and Hackfeld, J. and Klimm, M.},
 title = {Tight bounds for undirected graph exploration with pebbles and multiple agents},
 journal = {Journal of the ACM},
 volume = {66},
 number = {6},
 pages = {40(41)},
 year = {2019},
}