Randomized Speedup of the Bellman–Ford Algorithm
From MaRDI portal
Publication:5194707
DOI10.1137/1.9781611973020.6zbMath1429.68170arXiv1111.5414OpenAlexW1641312805MaRDI QIDQ5194707
Michael J. Bannister, David Eppstein
Publication date: 17 September 2019
Published in: 2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.5414
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Randomized algorithms (68W20)
Related Items (2)
An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs ⋮ Lower bounds for non-adaptive shortest path relaxation
This page was built for publication: Randomized Speedup of the Bellman–Ford Algorithm
