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^{1.5}\log n)$ as a certain topological measure of $G$ varies from $1$ up to $\Theta(n)$. Moreover, an efficient CREW PRAM implementation is given. Our algorithm applies also to digraphs whose genus $\gamma$ is $o(n)$.

[1]  Greg N. Frederickson,et al.  Using cellular graph embeddings in solving all pairs shortest paths problems , 1989, 30th Annual Symposium on Foundations of Computer Science.

[2]  David G. Kirkpatrick,et al.  A Simple Parallel Tree Contraction Algorithm , 1989, J. Algorithms.

[3]  Paul G. Spirakis,et al.  Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems , 1994, Theor. Comput. Sci..

[4]  Paul G. Spirakis,et al.  A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph , 1986, ICALP.

[5]  J. Spencer.  Probabilistic Methods in Combinatorics , 1974 .

[6]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[7]  Grammati E. Pantziou,et al.  Computing Shortest Paths and Distances in Planar Graphs , 1991, ICALP.

[8]  Wojciech Rytter,et al.  Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract) , 1989, MFCS.

[9]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[10]  Yijie Han,et al.  Efficient parallel algorithms for computing all pair shortest paths in directed graphs , 1992, SPAA '92.

[11]  Greg N. Frederickson.  Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems , 1995, J. Algorithms.

[12]  Paul G. Spirakis,et al.  Efficient parallel algorithms for shortest paths in planar digraphs , 1992, BIT Comput. Sci. Sect..

[13]  Greg N. Frederickson,et al.  Planar graph decomposition and all pairs shortest paths , 1991, JACM.

[14]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[15]  Thomas Lengauer.  Efficient Algorithms for the Constraint Generation for Integrated Circuit Layout Compaction , 1983, WG.

[16]  David Maier,et al.  An Efficient Method for Storing Ancestor Information in Trees , 1979, SIAM J. Comput..

[17]  Andrzej Lingas,et al.  Efficient Parallel Algorithms for Path Problems in Planar Directed Graphs , 1990, SIGAL International Symposium on Algorithms.

[18]  Edith Cohen.  Efficient parallel shortest-paths in digraphs with a separator decomposition , 1993, SPAA '93.