A More General Algorithm for Computing Closed Semiring Costs Between Vertices of a Directed Graph.
John G. FletcherPublished in: Commun. ACM (1980)
Keyphrases
- directed graph
- undirected graph
- objective function
- learning algorithm
- cost function
- simulated annealing
- graph structure
- dynamic programming
- special case
- optimal solution
- probabilistic model
- combinatorial optimization
- k means
- shortest path problem
- np hard
- worst case
- expectation maximization
- segmentation algorithm
- detection algorithm
- metaheuristic
- computational complexity
- hamiltonian cycle
- directed edges