Negative cycle detection problem

Authors:
Chi-Him Wong;Yiu-Cheong Tam
Affiliations:
The Chinese University of Hong Kong;The Chinese University of Hong Kong
Venue:
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Year:
2005

Citing 2
Cited 1

Scaling Algorithms for the Shortest Paths Problem

SIAM Journal on Computing
Negative-Cycle Detection Algorithms

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms

Shortest-path feasibility algorithms: An experimental evaluation

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we will describe some heuristics that can be used to improve the runtime of a wide range of commonly used algorithms for the negative cycle detection problem significantly, such as Bellman-Ford-Tarjan (BFCT) algorithm, Goldberg-Radzik (GORC) algorithm and Bellman-Ford-Moore algorithm with Predecessor Array (BFCF). The heuristics are very easy to be implemented and only require modifications of several lines of code of the original algorithms. We observed that the modified algorithms outperformed the original ones, particularly in random graphs and no cycle graphs. We discovered that 69% of test cases have improved. Also, the improvements are sometimes dramatic, which have an improvement of a factor of 23, excluding the infinity case, while the worst case has only decreased by 85% only, which is comparably small when compared to the improvement.