Speeding Up Shortest Path Algorithms

DOI10.1007/978-3-642-35261-4_19zbMath1260.68445arXiv1212.6327OpenAlexW1792863046MaRDI QIDQ4909532

Marko Grgurovič, Andrej Brodnik

Publication date: 21 March 2013

Published in: Algorithms and Computation (Search for Journal in Brave)

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

zbMATH Keywords

all pairs shortest pathsingle source shortest path

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Computing All-Pairs Shortest Paths by Leveraging Low Treewidth

This page was built for publication: Speeding Up Shortest Path Algorithms