Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem


We present here an algorithm for detecting (and outputting, if exists) a negative cycle in an n-vertex planar digraph G with real edge weights. Its running time ranges from O(n) up to O(n log n) as a certain topological measure of G varies from 1 up to Θ(n). Moreover, an efficient CREW PRAM implementation is given. Our algorithm applies also to digraphs… (More)
DOI: 10.1007/3-540-58325-4_190


1 Figure or Table