Last change: 02.02.2024 10:23.
by Birx, A.;
Disser, Y.; Hopp, A. and Karousatou, C.
Reference:
Birx, A.; Disser, Y.; Hopp, A. and Karousatou, C.: "An Improved Lower Bound for Competitive Graph Exploration", Theoretical Computer Science, vol. 868, pp. 65–86, 2021.
Bibtex Entry:
@article{BirxDisserHoppKarousatou/21,
author = {Birx, A. and Disser, Y. and Hopp, A. and Karousatou, C.},
title = {An Improved Lower Bound for Competitive Graph Exploration},
journal = {Theoretical Computer Science},
year = {2021},
volume = {868},
pages = {65--86},
tier = {3},
} 
