BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR94-206
ENTRY:: January 20, 1995
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Kavvadias, Dimitrios
AUTHOR:: Pantziou, Grammati E.
AUTHOR:: Spirakis, Paul G.
AUTHOR:: Zaroliagis, Christos D.
NOTE:: The 'January' in DATE is an arbitrary placeholder.
DATE:: January 1994
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
$\Theta(n)$.  Moreover, an efficient CREW PRAM implementation is
given.  Our algorithm applies also to digraphs whose genus $\gamma$ is
$o(n)$.
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR94-206.pdf
END::