) algorithm for L(2, 1)-labeling of trees.
Toru HasunumaToshimasa IshiiHirotaka OnoYushi UnoPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- dynamic programming
- learning algorithm
- tree structure
- times faster
- computational complexity
- preprocessing
- experimental evaluation
- worst case
- segmentation algorithm
- computational cost
- significant improvement
- improved algorithm
- detection algorithm
- np hard
- active learning
- k means
- data sets
- simulated annealing
- convergence rate
- optimization algorithm
- matching algorithm
- binary tree
- decision trees
- path planning
- classification algorithm
- similarity measure
- search space
- linear programming
- high accuracy
- probabilistic model