Lower Bounds for Graph Exploration Using Local Policies

Aditya Kumar Akash, Sándor P. Fekete, Seoung Kyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin. Lower Bounds for Graph Exploration Using Local Policies. In Mohammad Kaykobad, Rossella Petreschi, editors, WALCOM: Algorithms and Computation - 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings. Volume 9627 of Lecture Notes in Computer Science, pages 55-67, Springer, 2016. [doi]

@inproceedings{AkashFLLMM16,
  title = {Lower Bounds for Graph Exploration Using Local Policies},
  author = {Aditya Kumar Akash and Sándor P. Fekete and Seoung Kyou Lee and Alejandro López-Ortiz and Daniela Maftuleac and James McLurkin},
  year = {2016},
  doi = {10.1007/978-3-319-30139-6_5},
  url = {http://dx.doi.org/10.1007/978-3-319-30139-6_5},
  researchr = {https://researchr.org/publication/AkashFLLMM16},
  cites = {0},
  citedby = {0},
  pages = {55-67},
  booktitle = {WALCOM: Algorithms and Computation - 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings},
  editor = {Mohammad Kaykobad and Rossella Petreschi},
  volume = {9627},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-30138-9},
}