Floats, Integers, and Single Source Shortest Paths

DOI10.1006/JAGM.2000.1080MaRDI QIDQ4485191zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Scaling Algorithms for the Shortest Paths Problem
• scientific article; zbMATH DE number 437547
• Undirected single-source shortest paths with positive integer weights in linear time

Cited in

(8)

• 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
• A simple algorithm for replacement paths problem
• An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
• Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
• The saga of minimum spanning trees
• A faster computation of the most vital edge of a shortest path

This page was built for publication: Floats, Integers, and Single Source Shortest Paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4485191)