A hybrid single-source shortest path algorithm
نویسندگان
چکیده
منابع مشابه
Delta-Stepping: A Parallel Single Source Shortest Path Algorithm
In spite of intensive research, little progress has been made towards fast and work-eecient parallel algorithms for the single source shortest path problem. Our-stepping algorithm, a generalization of Dial's algorithm and the Bellman-Ford algorithm, improves this situation at least in the following \average-case" sense: For random directed graphs with edge probability d n and uniformly distribu...
متن کامل-stepping : a Parallel Single Source Shortest Path Algorithm
In spite of intensive research, little progress has been made towards fast and work-eecient parallel algorithms for the single source shortest path problem. Our-stepping algorithm, a generalization of Dial's algorithm and the Bellman-Ford algorithm, improves this situation at least in the following \average-case" sense: For random directed graphs with edge probability d n and uniformly distribu...
متن کاملNetwork Ows Single Source Shortest Path Problem
In these notes we study some problems in Network Flows For a more compre hensive treatment the reader is referred to the surveys or to the recent book Network ow problems arise in a variety of settings the underlying networks might be transportation networks communication networks hydraulic networks computer chips or some abstract network The eld was born from applications in the s and s and ha...
متن کاملA Faster Algorithm for the Single Source Shortest Path Problem with Few Distinct Positive Lengths Citation
In this paper, we propose an efficient method for implementing Dijkstra’s algorithm for the Single Source Shortest Path Problem (SSSPP) in a graph whose edges have positive length, and where there are few distinct edge lengths. The SSSPP is one of the most widely studied problems in theoretical computer science and operations research. On a graph with n vertices, m edges and K distinct edge len...
متن کاملA faster algorithm for the single source shortest path problem with few distinct positive lengths
In this paper, we propose an efficient method for implementing Dijkstra’s algorithm for the Single Source Shortest Path Problem (SSSPP) in a graph with positively lengthed edges, and where there are few distinct lengths. The SSSPP is one of the most widely studied problems in theoretical computer science and operations research. On a graph with n vertices, m edges and K distinct edge lengths, o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES
سال: 2019
ISSN: 1303-6203
DOI: 10.3906/elk-1901-23