Lower and upper competitive bounds for online directed graph exploration. Foerster, K. & Wattenhofer, R. Theor. Comput. Sci., 655:15–29, 2016. 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
{"_id":"RbPQ4agvunMyT6h9v","bibbaseid":"foerster-wattenhofer-loweranduppercompetitiveboundsforonlinedirectedgraphexploration-2016","authorIDs":[],"author_short":["Foerster, K.","Wattenhofer, R."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Klaus-Tycho"],"propositions":[],"lastnames":["Foerster"],"suffixes":[]},{"firstnames":["Roger"],"propositions":[],"lastnames":["Wattenhofer"],"suffixes":[]}],"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","bibtex":"@article{DBLP:journals/tcs/FoersterW16,\n author = {Klaus{-}Tycho Foerster and\n Roger Wattenhofer},\n title = {Lower and upper competitive bounds for online directed graph exploration},\n journal = {Theor. Comput. Sci.},\n volume = {655},\n pages = {15--29},\n year = {2016},\n url = {https://doi.org/10.1016/j.tcs.2015.11.017},\n doi = {10.1016/j.tcs.2015.11.017},\n timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/tcs/FoersterW16.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Foerster, K.","Wattenhofer, R."],"key":"DBLP:journals/tcs/FoersterW16","id":"DBLP:journals/tcs/FoersterW16","bibbaseid":"foerster-wattenhofer-loweranduppercompetitiveboundsforonlinedirectedgraphexploration-2016","role":"author","urls":{"Paper":"https://doi.org/10.1016/j.tcs.2015.11.017"},"downloads":0},"bibtype":"article","biburl":"https://dblp.org/pid/w/RogerWattenhofer.bib","creationDate":"2020-09-29T17:54:13.120Z","downloads":0,"keywords":[],"search_terms":["lower","upper","competitive","bounds","online","directed","graph","exploration","foerster","wattenhofer"],"title":"Lower and upper competitive bounds for online directed graph exploration","year":2016,"dataSources":["sBqdbkxTbPrBCJtZ9"]}