The delta-stepping algorithm, introduced by Meyer and Sanders (2000), is a parallel-friendly variant of Dijkstra’s algorithm for the single-source shortest path problem. It works by dividing edges ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results