Tomasz Kociumaka, Adam Polak 0001. Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths. In Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, Grzegorz Herman, editors, 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands. Volume 274 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]
@inproceedings{Kociumaka023, title = {Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths}, author = {Tomasz Kociumaka and Adam Polak 0001}, year = {2023}, doi = {10.4230/LIPIcs.ESA.2023.72}, url = {https://doi.org/10.4230/LIPIcs.ESA.2023.72}, researchr = {https://researchr.org/publication/Kociumaka023}, cites = {0}, citedby = {0}, booktitle = {31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands}, editor = {Inge Li Gørtz and Martin Farach-Colton and Simon J. Puglisi and Grzegorz Herman}, volume = {274}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, isbn = {978-3-95977-295-2}, }