Computer Science – Data Structures and Algorithms
Scientific paper
2011-11-23
Computer Science
Data Structures and Algorithms
12 Pages, 6 Figures, ANALCO 2012
Scientific paper
We describe a variant of the Bellman-Ford algorithm for single-source shortest paths in graphs with negative edges but no negative cycles that randomly permutes the vertices and uses this randomized order to process the vertices within each pass of the algorithm. The modification reduces the worst-case expected number of relaxation steps of the algorithm, compared to the previously-best variant by Yen (1970), by a factor of 2/3 with high probability. We also use our high probability bound to add negative cycle detection to the randomized algorithm.
Bannister Michael J.
Eppstein David
No associations
LandOfFree
Randomized Speedup of the Bellman-Ford Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Randomized Speedup of the Bellman-Ford Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Randomized Speedup of the Bellman-Ford Algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-376767