English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths

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.

Item is

Basic

hide
Genre: Conference Paper
Latex : {Bellman}-{Ford} Is Optimal for Shortest Hop-Bounded Paths

Files

hide Files
:
LIPIcs.ESA.2023.72.pdf (Publisher version), 754KB
Name:
LIPIcs.ESA.2023.72.pdf
Description:
-
OA-Status:
Gold
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-

Locators

show

Creators

hide
 Creators:
Kociumaka, Tomasz1, Author           
Polak, Adam1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

hide
Language(s): eng - English
 Dates: 20232023
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Kociumaka_ESA23
DOI: 10.4230/LIPIcs.ESA.2023.72
URN: urn:nbn:de:0030-drops-187257
 Degree: -

Event

hide
Title: 31st Annual European Symposium on Algorithms
Place of Event: Amsterdam, The Netherlands
Start-/End Date: 2023-09-04 - 2023-09-06

Legal Case

show

Project information

show

Source 1

hide
Title: 31st Annual European Symposium on Algorithms
  Abbreviation : ESA 2023
  Subtitle : ESA 2023, September 4–6, 2023, Amsterdam, The Netherlands
Source Genre: Proceedings
 Creator(s):
Gørtz, Inge Li1, Editor
Farach-Colton, Martin1, Editor
Puglisi, Simon J.1, Editor
Herman, Grzegorz1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Wadern : Schloss Dagstuhl
Pages: - Volume / Issue: - Sequence Number: 72 Start / End Page: 1 - 10 Identifier: ISBN: 978-3-95977-295-2

Source 2

hide
Title: Leibniz International Proceedings in Informatics
  Abbreviation : LIPIcs
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 274 Sequence Number: - Start / End Page: - Identifier: ISSN: 1868-8969