Fetching the paper…
Reading the bibliography…
The single-source shortest path (SSSP) problem is a well-studied problem that is used in many applications.
Network flow theory
Lester R Ford Jr · 1956
Earlier work this paper cites.
On a routing problem
Richard Bellman · 1958
Earlier work this paper cites.
A note on two problems in connexion with graphs
Edsger W. Dijkstra · 1959
Earlier work this paper cites.
The parallel evaluation of general arithmetic expressions
Richard P. Brent · 1974
Earlier work this paper cites.
Fibonacci heaps and their uses in improved network optimization algorithms
M. L. Fredman and R. E. Tarjan · 1984
Earlier work this paper cites.
The pairing heap: A new form of self-adjusting heap
Michael L. Fredman, Robert Sedgewick, Daniel D. Sleator, and Robert E. Tarjan · 1986
Earlier work this paper cites.
The input/output complexity of sorting and related problems
Alok Aggarwal and S. Vitter, Jeffrey · 1988
Earlier work this paper cites.
Handbook of theoretical computer science (vol. a)
Richard M. Karp and Vijaya Ramachandran · 1990
Earlier work this paper cites.
Introduction to Parallel Algorithms
Joseph JaJa · 1992
Earlier work this paper cites.
A linear-processor polylog-time algorithm for shortest paths in planar graphs
P.N. Klein and S. Subramanian · 1993
Earlier work this paper cites.
Very fast optimal parallel algorithms for heap construction
P. F. Dietz and R. Ramant · 1994
Earlier work this paper cites.
Scaling algorithms for the shortest paths problem
Andrew V. Goldberg · 1995
Earlier work this paper cites.
An efficient parallel algorithm for shortest paths in planar layered digraphs
Sairam Subramanian, Roberto Tamassia, and Jeffrey Scott Vitter · 1995
Earlier work this paper cites.
An efficient algorithm for concurrent priority queue heaps
Galen C. Hunt, Maged M. Michael, Srinivasan Parthasarathy, and Michael L. Scott · 1996
Earlier work this paper cites.
A simple parallel algorithm for the single-source shortest path problem on planar digraphs
Jesper Larsson Träff and Christos D. Zaroliagis · 1996
Earlier work this paper cites.
A parallel priority queue with constant time operations
Gerth Stølting Brodal, Jesper Larsson Träff, and Christos D. Zaroliagis · 1998
Earlier work this paper cites.
Shortest paths in digraphs of small treewdith. part II: optimal parallel algorithms
Shiva Chaudhuri and Christos D. Zaroliagis · 1998
Earlier work this paper cites.
A parallelization of dijkstra’s shortest path algorithm
Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, and Peter Sanders · 1998
Earlier work this paper cites.
Delta-stepping: A parallel single source shortest path algorithm
Ulrich Meyer and Peter Sanders · 1998
Earlier work this paper cites.
Randomized priority queues for fast parallel access
Peter Sanders · 1998
Cited alongside, same era.
Time-work tradeoffs of the single-source shortest paths problem
Hanmao Shi and Thomas H. Spencer · 1999
Cited alongside, same era.
Polylog-time and near-linear work approximation scheme for undirected shortest paths
Edith Cohen · 2000
Cited alongside, same era.
Introduction to Algorithms
Thomas H. Cormen, Clifford Stein, Ronald L. Rivest, and Charles E. Leiserson · 2001
Cited alongside, same era.
Efficient parallel algorithms for planar st -graphs
Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daescu · 2003
Cited alongside, same era.
Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, and Norbert Zeh · 2004
Cited alongside, same era.
A memory access model for highly-threaded many-core architectures
Lin Ma, Kunal Agrawal, and Roger D. Chamberlain · 2014
Later among the works it cites.
A novel computational model for GPUs with applications to efficient algorithms
Atsushi Koike and Kunihiko Sadakane · 2015
Later among the works it cites.
Parallel shortest paths using radius stepping
Guy E. Blelloch, Yan Gu, Yihan Sun, and Kanat Tangwongsan · 2016
Later among the works it cites.
An efficient implementation of the Bellman-Ford algorithm for kepler GPU architectures
Federico Busato and Nicola Bombieri · 2016
Later among the works it cites.
Hopsets with constant hopbound, and applications to approximate shortest paths
Michael Elkin and Ofer Neiman · 2016
Later among the works it cites.
Communication efficient algorithms for top-k selection problems
Lorenz Hübschle-Schneider and Peter Sanders · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cache-oblivious shortest paths in graphs using buffer heap
Rezaul Alam Chowdhury and Vijaya Ramachandran · 2004
Cited alongside, same era.
Accelerating large graph algorithms on the gpu using CUDA
Pawan Harish and P. J. Narayanan · 2007
Cited alongside, same era.
Fundamental parallel algorithms for private-cache chip multiprocessors
Lars Arge, Michael Goodrich, Michael Nelson, and Nodari Sitchinava · 2008
Cited alongside, same era.
Gpu-quicksort: A practical quicksort algorithm for graphics processors
Daniel Cederman and Philippas Tsigas · 2009
Cited alongside, same era.
An analytical model for a GPU architecture with memory-level and thread-level parallelism awareness
Sunpyo Hong and Hyesoon Kim · 2009
Cited alongside, same era.
Inter-block GPU communication via fast barrier synchronization
Shucai Xiao and Wu-chun Feng · 2010
Cited alongside, same era.
Later among the works it cites.
Gunrock: A high-performance graph processing library on the gpu
Yangzihao Wang, Andrew Davidson, Yuechao Pan, Yuduo Wu, Andy Riffel, and John D. Owens · 2016
Later among the works it cites.
Lock-based synchronization for GPU architectures
Yunlong Xu, Lan Gao, Rui Wang, Zhongzhi Luan, Weiguo Wu, and Depei Qian · 2016
Later among the works it cites.
Performance evaluation of priority queues for fine-grained parallel tasks on GPUs
N. Baudis, F. Jacob, and P. Andelfinger · 2017
Later among the works it cites.
An efficient multiway mergesort for GPU architectures
Henri Casanova, John Iacono, Ben Karsin, Nodari Sitchinava, and Volker Weichert · 2017
Later among the works it cites.
Beyond binary search: Parallel in-place construction of implicit search tree layouts
Kyle Berney, Henri Casanova, Alyssa Higuchi, Ben Karsin, and Nodari Sitchinava · 2018
Later among the works it cites.
Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC
Michael Elkin and Ofer Neiman · 2019
Closest in time.
Throughput-oriented GPU memory allocation
Isaac Gelado and Michael Garland · 2019
Closest in time.
A fast work-efficient SSSP algorithm for gpus
Kai Wang, Don Fussell, and Calvin Lin · 2021
Closest in time.
Parallel shortest paths with negative edge weights
Nairen Cao, Jeremy T. Fineman, and Katina Russell · 2022
Closest in time.
CUDA C++ best practices guide
NVIDIA · 2022
Closest in time.
CUDA C++ programming guide
NVIDIA · 2022
Closest in time.
CUDA toolkit documentation
NVIDIA · 2022
Closest in time.