A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths
From MaRDI portal
Publication:850796
DOI10.1007/s00453-005-1199-1zbMath1101.68071OpenAlexW2006570180MaRDI QIDQ850796
Publication date: 6 November 2006
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-005-1199-1
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound ⋮ An all-pairs shortest path algorithm for bipartite graphs ⋮ Algebraic methods in the congested clique ⋮ The Floyd-Warshall algorithm on graphs with negative cycles
This page was built for publication: A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths
