Abstract
We present an I/O-efiicient algorithm for the single-source shortest path problem on undirected graphs G = (V, E). Our algorithm performs O(√VE/B)log2(W/w)+sort(V+E) log log(VB/E)) I/Os1, where ω ∈ ℝ+ and W ∈ ℝ+ are the minimal and maximal edge weights in G, respectively. For uniform random edge weights in (0,1], the expected I/O-complexity of our algorithm is O(√VE/B+((V+E)/B)log2 B+sort (V+E)). © Springer-Verlag 2003.
Cite
CITATION STYLE
Meyer, U., & Zeh, N. (2003). I/O-Efficient Undirected Shortest Paths. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2832, 434–445. https://doi.org/10.1007/978-3-540-39658-1_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
