Parallel Algorithms for Detection of Negative Cycles

Investor logo

Warning

This publication doesn't include Faculty of Arts. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

BRIM Lubos ČERNÁ Ivana HEJTMÁNEK Lukáš

Year of publication 2003
Type Article in Proceedings
Conference Proceedings of the 10th ParCo Conference
MU Faculty or unit

Faculty of Informatics

Citation
Field Informatics
Keywords model-checking; parallel computing
Description 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.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.