An Improved Lower Bound for Competitive Graph Exploration (bibtex)
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, 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},
	pdf = {pdfs/BirxDisserHoppKarousatou21.pdf},
	tier = {3},
	}
Powered by bibtexbrowser