Finding all the negative cycles in a directed graph (Q1602697)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding all the negative cycles in a directed graph |
scientific article |
Statements
Finding all the negative cycles in a directed graph (English)
0 references
24 June 2002
0 references
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.
0 references
digraphs
0 references
search strategies
0 references
algorithm
0 references
cycles
0 references
