Lower and upper competitive bounds for online directed graph exploration. Foerster, K. & Wattenhofer, R. Theor. Comput. Sci., 655:15–29, 2016.
Lower and upper competitive bounds for online directed graph exploration [link]Paper  doi  bibtex   
@article{DBLP:journals/tcs/FoersterW16,
  author    = {Klaus{-}Tycho Foerster and
               Roger Wattenhofer},
  title     = {Lower and upper competitive bounds for online directed graph exploration},
  journal   = {Theor. Comput. Sci.},
  volume    = {655},
  pages     = {15--29},
  year      = {2016},
  url       = {https://doi.org/10.1016/j.tcs.2015.11.017},
  doi       = {10.1016/j.tcs.2015.11.017},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/tcs/FoersterW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0