Polynomial-Time Algorithm for Sliding Tokens on Trees.
Erik D. DemaineMartin L. DemaineEli Fox-EpsteinDuc A. HoangTakehiro ItoHirotaka OnoYota OtachiRyuhei UeharaTakeshi YamadaPublished in: ISAAC (2014)
Keyphrases
- worst case
- experimental evaluation
- tree structure
- computational complexity
- dynamic programming
- learning algorithm
- theoretical analysis
- cost function
- special case
- optimal solution
- computational cost
- probabilistic model
- objective function
- detection algorithm
- computationally efficient
- times faster
- improved algorithm
- similarity measure
- particle swarm optimization
- linear programming
- np hard
- k means
- matching algorithm
- significant improvement
- convergence rate
- polynomial time complexity