Recent results on the single-source shortest paths problem
@article{Raman1997RecentRO,
title={Recent results on the single-source shortest paths problem},
author={R. Raman},
journal={SIGACT News},
year={1997},
volume={28},
pages={81-87}
}We summarize the currently best known theoretical results for the single-source shortest paths problem for directed graphs with non-negative edge weights. We also point out that a recent result due to Cherkassky, Goldberg and Silverstein (1996) leads to even better time bounds for this problem than claimed by the authors.
Topics from this paper
81 Citations
A Simple Shortest Path Algorithm with Linear Average Time
- Mathematics, Computer Science
- ESA
- 2001
- 88
- Highly Influenced
Undirected single-source shortest paths with positive integer weights in linear time
- Mathematics, Computer Science
- JACM
- 1999
- 392
- PDF
Shortest path algorithm with pre-calculated single link failure recovery for non-negative weighted undirected graphs
- Computer Science
- 2010 International Conference on Information and Emerging Technologies
- 2010
- 5
Undirected single source shortest paths in linear time
- Mathematics, Computer Science
- Proceedings 38th Annual Symposium on Foundations of Computer Science
- 1997
- 100
A New Single-Source Shortest Path Algorithm for Nonnegative Weight Graph
- Mathematics, Computer Science
- 2014
- 1
- PDF
A Shortest Path Algorithm for Real-Weighted Undirected Graphs
- Mathematics, Computer Science
- SIAM J. Comput.
- 2005
- 76
- PDF
A near linear shortest path algorithm for weighted undirected graphs
- Mathematics
- 2011 IEEE Symposium on Computers & Informatics
- 2011
- 1