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

@inproceedings{Meyer2006IOEfficientUS,
  title={I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths},
  author={Ulrich Meyer and Norbert Zeh},
  booktitle={ESA},
  year={2006}
}
We show how to compute single-source shortest paths in undirected graphs with non-negative edge lengths in O( p nm/B log n + MST (n, m)) I/Os, where n is the number of vertices, m is the number of edges, B is the disk block size, and MST (n, m) is the I/O-cost of computing a minimum spanning tree. For sparse graphs, the new algorithm performs O((n/ √ B) log n) I/Os. This result removes our previous algorithm’s dependence on the edge lengths in the graph. 
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…