Engineering a Parallel Δ-stepping Algorithm
Published • Dec 1, 2019
NobleIDNI7P50W11R02S27
Authors:,,
Erika Duriakova
Deepak Ajwani
Neil Hurley
Abstract
Computation of the single-source shortest path (SSSP) is a fundamental primitive in many network analytics tasks. With the increasing size of networks to be analysed, there is a need for efficient tools to compute shortest paths, especially on the widely adopted shared-memory multicore architectures...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!