Finding all the negative cycles in a directed graph
The authors study weighted directed graphs, where the edges can have negative weights. They give an algorithm to find all the elementary cycles with negative total weights. This algorithm is constructed in the divide-and-conquer paradigm and some recursive procedure. The algorithm is tested in three series of examples.
scientific article; zbMATH DE number 1758382