Locality-based relaxation: an efficient method for GPU-based computation of shortest paths

DOI10.1007/978-3-319-68953-1_5MaRDI QIDQ1698756zbMATH OpenOpenAlexFDO

Authors Mohsen Safari, Ali Ebnenasir

Publication date 16 February 2018

Full work available at URL https://hal.inria.fr/hal-01760642/file/440117_1_En_5_Chapter.pdf

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 7266346
• A novel single source shortest path algorithm
• Computational Science – ICCS 2005
• A faster algorithm for the single source shortest path problem with few distinct positive lengths
• A single-source shortest path algorithm for dynamic graphs

Cited in

(1)

• Automated verification of the parallel Bellman-Ford algorithm

This page was built for publication: Locality-based relaxation: an efficient method for GPU-based computation of shortest paths

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