Floats, Integers, and Single Source Shortest Paths

DOI10.1006/jagm.2000.1080zbMath0951.68025OpenAlexW1964948588MaRDI QIDQ4485191

Mikkel Thorup

Publication date: 5 June 2000

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8b22b7fec807bbb442a6d1805ae3f2a43ffe2a7d

zbMATH Keywords

nonnegative floating point weights

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items

A simple algorithm for replacement paths problem ⋮ Approximate distance oracles for graphs with dense clusters ⋮ Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs ⋮ Path Laplacian matrices: introduction and application to the analysis of consensus in networks ⋮ The saga of minimum spanning trees ⋮ Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs ⋮ An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs ⋮ A faster computation of the most vital edge of a shortest path