Abstract
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 1.5 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 whose genus γ is o(n).
Cite
CITATION STYLE
Kavvadias, D., Pantziou, G. E., Spirakis, P. G., & Zaroliagis, C. D. (1994). Efficient sequential and parallel algorithms for the negative cycle problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 270–278). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_190
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
