Optimal-Time Algorithm for the k-Node-Connectivity Augmentation Problem for Ternary Trees.
Toshimitsu MasuzawaKenichi HagiharaNobuki TokuraKoichi WadaPublished in: Systems and Computers in Japan (1986)
Keyphrases
- worst case
- tree structure
- optimal solution
- dynamic programming
- computational complexity
- experimental evaluation
- preprocessing
- detection algorithm
- cost function
- np hard
- learning algorithm
- recognition algorithm
- convergence rate
- closed form
- optimization algorithm
- simulated annealing
- expectation maximization
- computational cost
- k means
- binary tree
- exhaustive search
- objective function
- optimal parameters
- globally optimal
- undirected graph
- tree construction
- linear programming
- path planning
- matching algorithm
- binary images
- high accuracy
- search space
- decision trees