scientific article; zbMATH DE number 7266346

DOI10.13209/J.0479-8023.2019.113MaRDI QIDQ5129335zbMATH OpenWikidataFDO

Authors Shuo Han, Lei Zou

Publication date 27 October 2020

Full work available at URL https://doi.org/10.13209/J.0479-8023.2019.113

zbMATH Keywords

data-level parallelismdelta graphdynamic graphshortest distancethread-level parallelism

Mathematics Subject Classification ID

Distance in graphs (05C12) Data structures (68P05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 56471
• Parallel Algorithms for Dynamic Shortest Path Problems
• scientific article; zbMATH DE number 1222607
• Computational Science – ICCS 2005
• A parallel shortest path algorithm
• Efficient parallel algorithms for computing all pair shortest paths in directed graphs
• scientific article; zbMATH DE number 1512693
• An all pairs shortest path algorithm for dynamic graphs
• A Randomized Parallel Algorithm for Single-Source Shortest Paths
• Optimal parallel algorithm for shortest-paths problem on interval graphs

Cited in

(3)

• Locality-based relaxation: an efficient method for GPU-based computation of shortest paths
• A single-source shortest path algorithm for dynamic graphs
• An all pairs shortest path algorithm for dynamic graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5129335)