Negative-Weight Cycle Algorithms

The problem of finding a negative cycle in a weighted, directed graph is discussed here. First the algorithm for printing out a negative cycle reachable from the source s, with the running time no worse than the Bellman-Ford algorithm for the single-source shortest-path problem, is presented. Then an approach with the same time complexity, which could be used for outputting a negative cycle that may not be reachable from s, is reported.

• Type: Conference
• Year: 2006
• Where: FCS
• Authors: Xiuzhen Huang
• Keywords: Directed Graph, FCS 2006, FCS 2007, Negative Cycle, Single-source Shortest-path Problem