Parallel Algorithms for Detection of Negative Cycles
Luboš Brim, Ivana Černá, Lukáš Hejtmánek · 2003
Several new parallel algorithms for the single source shortest paths and for the negative cycle detection problems on directed graphs with real edge weights and given by adjacency list are developed, analysed, and experimentally compared. The algorithms are to be performed on clusters of workstations that communicate via a message passing mechanism.