I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths

DOI10.1145/2229163.2229166zbMath1295.05235OpenAlexW2011204371MaRDI QIDQ3189063

Norbert Zeh, Ulrich Meyer

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2229163.2229166

zbMATH Keywords

graph algorithmsshortest path algorithmsmemory hierarchiesI/O-efficient algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

This page was built for publication: I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths