An Algorithm for L(2, 1)-Labeling of Trees.
Toru HasunumaToshimasa IshiiHirotaka OnoYushi UnoPublished in: SWAT (2008)
Keyphrases
- times faster
- theoretical analysis
- k means
- np hard
- cost function
- learning algorithm
- computational complexity
- preprocessing
- computational cost
- experimental evaluation
- high accuracy
- significant improvement
- similarity measure
- optimal solution
- dynamic programming
- detection algorithm
- clustering method
- tree structure
- data sets
- search space
- probabilistic model
- linear programming
- particle swarm optimization
- hidden markov models
- segmentation algorithm
- decision trees
- convergence rate
- improved algorithm
- binary tree