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

DOI10.1145/2229163.2229166MaRDI QIDQ3189063zbMATH OpenOpenAlexFDO

Authors Ulrich Meyer, Norbert Zeh

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

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

Recommendations

• I/O-efficient undirected shortest paths
• I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
• Design and implementation of a practical I/O-efficient shortest paths algorithm
• A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths
• Automata, Languages and Programming

Cited in

(6)

• I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
• A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths
• I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
• I/O-efficient undirected shortest paths
• Developments in the theory of randomized shortest paths with a comparison of graph node distances
• Design and implementation of a practical I/O-efficient shortest paths algorithm

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

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