English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths

MPS-Authors
/persons/resource/persons284929

Kociumaka,  Tomasz
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons289639

Polak,  Adam
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

LIPIcs.ESA.2023.72.pdf
(Publisher version), 754KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Kociumaka, T., & Polak, A. (2023). Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths. In I. L. Gørtz, M. Farach-Colton, S. J. Puglisi, & G. Herman (Eds.), 31st Annual European Symposium on Algorithms (pp. 1-10). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ESA.2023.72.


Cite as: https://hdl.handle.net/21.11116/0000-0010-6B1D-7
Abstract
There is no abstract available