Finding all the negative cycles in a directed graph.

Takeo Yamada Harunobu Kinoshita

Published in: Discret. Appl. Math. (2002)

Keyphrases

directed graph
strongly connected
random walk
graph structure
positive and negative
directed acyclic graph
graph properties
shortest path problem
graph structures
maximum flow
directed edges
machine learning
disjoint paths
undirected graph
tree structure
special case
computational complexity