An algorithm for tree-realizability of distance matrices.
Vladimir BatageljTomaz PisanskiJ. M. S. Simões-PereiraPublished in: Int. J. Comput. Math. (1990)
Keyphrases
- distance matrix
- dynamic programming
- computational complexity
- optimization algorithm
- cost function
- detection algorithm
- k means
- significant improvement
- computational cost
- preprocessing
- learning algorithm
- tree structure
- average distance
- distance transform
- recognition algorithm
- matching algorithm
- experimental evaluation
- np hard
- particle swarm optimization
- linear programming
- worst case
- distance metric
- evolutionary algorithm
- search space
- pruning algorithm
- optimal solution
- similarity measure