An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings.
Ming-Yang KaoTak Wah LamWing-Kin SungHing-Fung TingPublished in: J. Algorithms (2001)
Keyphrases
- computational complexity
- preprocessing
- experimental evaluation
- tree structure
- optimization algorithm
- high accuracy
- theoretical analysis
- learning algorithm
- detection algorithm
- k means
- np hard
- recognition algorithm
- times faster
- matching algorithm
- particle swarm optimization
- simulated annealing
- improved algorithm
- neural network
- real valued
- convergence rate
- memory efficient
- tree construction
- unordered trees
- path planning
- computationally efficient
- linear programming
- dynamic programming
- multi objective
- search space
- objective function
- genetic algorithm