An algorithm for finding a representation of a subtree distance.
Kazutoshi AndoKoki SatoPublished in: J. Comb. Optim. (2018)
Keyphrases
- experimental evaluation
- optimal solution
- tree structure
- cost function
- optimization algorithm
- preprocessing
- search space
- matching algorithm
- dynamic programming
- linear programming
- learning algorithm
- high accuracy
- simulated annealing
- improved algorithm
- times faster
- worst case
- np hard
- computational cost
- computationally efficient
- theoretical analysis
- significant improvement
- k means
- computational complexity
- distance matrix
- segmentation algorithm
- detection algorithm
- ant colony optimization
- data structure
- delaunay triangulation
- average distance