An algorithm and a program for finding the minimax path tree in weighted digraphs.
Rodica BoliacPublished in: Comput. Sci. J. Moldova (1997)
Keyphrases
- tree structure
- binary tree
- objective function
- learning algorithm
- worst case
- computational complexity
- matching algorithm
- optimal solution
- detection algorithm
- dynamic programming
- cost function
- simulated annealing
- optimization algorithm
- convergence rate
- voronoi diagram
- search algorithm
- computational cost
- segmentation algorithm
- significant improvement
- k means
- preprocessing
- path planning
- recognition algorithm
- optimal path
- minimum spanning tree