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

DOI10.1007/11841036_49zbMath1131.05316OpenAlexW1598859508MaRDI QIDQ5449557

Norbert Zeh, Ulrich Meyer

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)

Related Items (3)

I/O-efficient algorithms for graphs of bounded treewidth ⋮ Design and Engineering of External Memory Traversal Algorithms for General Graphs ⋮ Via Detours to I/O-Efficient Shortest Paths

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