TY  - GEN 
AU  - Ortega Arranz, Héctor
AU  - Torres de la Sierra, Yuri
AU  - González Escribano, Arturo
AU  - Llanos Ferraris, Diego Rafael
PY  - 2013
SN  - 978-84-616-2723-3
UR  - https://uvadoc.uva.es/handle/10324/71120
AB  - The All-Pair Shortest-Path (APSP) problem is a well-known problem in graph theory whose objective is to find the shortest paths between any pair of nodes. Computing the distances from one source node to the rest and repeating this process for every...
LA  - eng
PB  - Universidad de Salamanca
KW  - Informática
KW  - APSP
KW  - Concurrent-kernel
KW  - Dijkstra
KW  - GPU
KW  - SSSP
KW  - ThreadBlock size
TI  - A Tuned, Concurrent-Kernel Approach to Speed Up the APSP problem
DO  - 10.5281/zenodo.14014033
ER  -