I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths

DOI10.1007/11841036_49MaRDI QIDQ5449557zbMATH OpenOpenAlexFDO

Authors Ulrich Meyer, Norbert Zeh

Publication date 11 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11841036_49

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• I/O-efficient undirected shortest paths
• I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths
• Via Detours to I/O-Efficient Shortest Paths
• A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths
• Design and implementation of a practical I/O-efficient shortest paths algorithm
• I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
• I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
• scientific article; zbMATH DE number 1830742
• Algorithm Theory - SWAT 2004
• I/O-efficient path traversal in succinct planar graphs

Cited in

(8)

• A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths
• I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths
• Design and Engineering of External Memory Traversal Algorithms for General Graphs
• Via Detours to I/O-Efficient Shortest Paths
• Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy
• Design and implementation of a practical I/O-efficient shortest paths algorithm
• I/O-efficient undirected shortest paths
• I/O-efficient algorithms for graphs of bounded treewidth

This page was built for publication: I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths

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