Abstract
During the winter semester 1996/1997 Kurt Mehlhorn gave a lecture series on algorithms for very large data sets. Towards the end he covered graph traversal problems like finding shortest paths on sparse graphs in external-memory. Kurt concluded the topic stating that there may not be much hope to solve these basic problems I/O-efficiently. The author, just about to finish his master's studies those days, took this as a challenge. The following paper reviews some detours, dead-ends, and happy ends of the author's still ongoing research on external-memory graph traversal. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Meyer, U. (2009). Via detours to I/O-efficient shortest paths. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5760 LNCS, pp. 219–232). https://doi.org/10.1007/978-3-642-03456-5_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
