A Forward-Backward Single-Source Shortest Paths Algorithm
نویسندگان
چکیده
منابع مشابه
A Faster Distributed Single-Source Shortest Paths Algorithm
We devise new algorithms for the single-source shortest paths (SSSP) problem in the CONGEST model of distributed computing. While close-to-optimal solutions, in terms of the number of rounds spent by the algorithm, have recently been developed for computing SSSP approximately, the fastest known exact algorithms are still far away from matching the lower bound of Ω̃( √ n +D) rounds by Peleg and R...
متن کاملA Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths
We study dynamic (1 + )-approximation algorithms for the single-source shortest paths problem in an unweighted undirected n-node m-edge graph under edge deletions. The fastest algorithm for this problem is an algorithm with O(n) total update time and constant query time by Bernstein and Roditty (SODA 2011). In this paper, we improve the total update time to O(n + m) while keeping the query time...
متن کاملA Randomized Parallel Algorithm for Single-Source Shortest Paths
We give a randomized parallel algorithm for computing single-source shortest paths in weighted digraphs. We show that the exact shortest-path problem can be efficiently reduced to solving a series of approximate shortest-path subproblems. Our algorithm for the approximate shortest-path problem is based on the technique used by Ullman and Yannakakis in a parallel algorithm for breadth-first sear...
متن کاملParallel Single-Source Shortest Paths
We designed and implemented a parallel algorithm for solving the single-source shortest paths (SSSP) problem for graphs with nonnegative edge weights, based on Gabow’s scaling algorithm for SSSP. This parallel Gabow algorithm attains a theoretical parallelism of Ω(E/(V lg∆ lgE/D)) in the worst case and Ω(E/(D lgV/D lgE/D lgDelta)with high probability on a random graph. In practice this algorith...
متن کاملFloats, Integers, and Single Source Shortest Paths
Floats are ugly, but to everyone but theoretical computer scientists, they are the real thing. A linear time algorithm is presented for the undirected single source shortest paths problem with oating point weights.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2015
ISSN: 0097-5397,1095-7111
DOI: 10.1137/140970975