The Floyd-Warshall algorithm on graphs with negative cycles.
Stefan HougardyPublished in: Inf. Process. Lett. (2010)
Keyphrases
- cost function
- graph structure
- improved algorithm
- minimum spanning tree
- dynamic programming
- high accuracy
- times faster
- detection algorithm
- optimization algorithm
- computational cost
- k means
- computational complexity
- learning algorithm
- significant improvement
- theoretical analysis
- search space
- tree structure
- matching algorithm
- optimal solution
- objective function
- adjacency graph
- hyper graph
- spanning tree
- graph model
- positive and negative
- segmentation algorithm
- computationally efficient
- simulated annealing
- probabilistic model
- bayesian networks