An Improved Lower Bound for Competitive Graph Exploration

Birx, A.; Disser, Y.; Hopp, A.; Karousatou, C.

by Birx, A., Disser, Y., Hopp, A. and Karousatou, C.

Reference:

An Improved Lower Bound for Competitive Graph Exploration (Birx, A., Disser, Y., Hopp, A. and Karousatou, C.), In Theoretical Computer Science, volume 868, 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},
}