Enhanced OpenMP Algorithm to Compute All-Pairs Shortest Path on x86 Architectures

Sergio Calderón, Enzo Rucci, Franco Chichizola

Graphs have become a key tool when modeling and solving problems in different areas. The Floyd-Warshall (FW) algorithm computes the shortest path between all pairs of vertices in a…