A General Lower Bound for Collaborative Tree Exploration

Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger. A General Lower Bound for Collaborative Tree Exploration. In Shantanu Das 0001, Sébastien Tixeuil, editors, Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO 2017, Porquerolles, France, June 19-22, 2017, Revised Selected Papers. Volume 10641 of Lecture Notes in Computer Science, pages 125-139, Springer, 2017. [doi]

@inproceedings{DisserMNSS17,
  title = {A General Lower Bound for Collaborative Tree Exploration},
  author = {Yann Disser and Frank Mousset and Andreas Noever and Nemanja Skoric and Angelika Steger},
  year = {2017},
  doi = {10.1007/978-3-319-72050-0_8},
  url = {https://doi.org/10.1007/978-3-319-72050-0_8},
  researchr = {https://researchr.org/publication/DisserMNSS17},
  cites = {0},
  citedby = {0},
  pages = {125-139},
  booktitle = {Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO 2017, Porquerolles, France, June 19-22, 2017, Revised Selected Papers},
  editor = {Shantanu Das 0001 and Sébastien Tixeuil},
  volume = {10641},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-72050-0},
}