External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths

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]

Authors

Tomasz Kociumaka

This author has not been identified. Look up 'Tomasz Kociumaka' in Google

Adam Polak 0001

This author has not been identified. Look up 'Adam Polak 0001' in Google
runs on