Locality-based relaxation: an efficient method for GPU-based computation of shortest paths
From MaRDI portal
Publication:1698756
DOI10.1007/978-3-319-68953-1_5zbMath1485.68305OpenAlexW2764073814MaRDI QIDQ1698756
Publication date: 16 February 2018
Full work available at URL: https://hal.inria.fr/hal-01760642/file/440117_1_En_5_Chapter.pdf
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items (1)
This page was built for publication: Locality-based relaxation: an efficient method for GPU-based computation of shortest paths