Lower bounds for non-adaptive shortest path relaxation

DOI10.1007/978-3-031-38906-1_27arXiv2305.09230OpenAlexW4385366100MaRDI QIDQ6179429

David Eppstein

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2305.09230

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• On the optimality of Bellman-Ford-Moore shortest path algorithm
• On rearrangeable and non-blocking switching networks
• New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches
• On a routing problem
• Shortest-path algorithms: Taxonomy and annotation
• Recognizing Bellman–Ford-Orderable Graphs
• Randomized Speedup of the Bellman–Ford Algorithm

This page was built for publication: Lower bounds for non-adaptive shortest path relaxation