Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

38

ISAAC
1994
Springer

favoriteEmaildiscussreport

95views Algorithms» more ISAAC 1994»

Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem

14 years 2 months ago

Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem

Download www.ceid.upatras.gr

We present here an algorithm for detecting (and outputting, if exists) a negative cycle in an n-vertex planar digraph G with real

Dimitris J. Kavvadias, Grammati E. Pantziou, Paul

Real-time Traffic

Algorithms | ISAAC 1994 | N-vertex Planar Digraph | Negative Cycle |

claim paper

Related Content

» Sequential and Parallel Algorithms for Mixed Packing and Covering

» Negative Examples for Sequential Importance Sampling of Binary Contingency Tables

» Techniques for Optimization of Net Algorithms

» Convergent MessagePassing Algorithms for Inference over General Graphs with Convex Free En...

» Scalable Parallel Algorithms for FPT Problems

» Observations in using parallel and sequential evolutionary algorithms for automatic softwa...

» Efficient incremental clock latency scheduling for large circuits

» Sequential logic rectifications with approximate SPFDs

» Cycle time and slack optimization for VLSIchips

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1994
Where	ISAAC
Authors	Dimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis

Comments (0)