A correction on Shiloach's algorithm for minimum linear arrangement of trees.
Juan Luis EstebanRamon Ferrer-i-CanchoPublished in: CoRR (2015)
Keyphrases
- times faster
- detection algorithm
- computational complexity
- tree structure
- optimization algorithm
- worst case
- closed form
- integer arithmetic
- matching algorithm
- objective function
- cost function
- preprocessing
- experimental evaluation
- square error
- linear complexity
- convergence rate
- optimal solution
- path planning
- expectation maximization
- high accuracy
- computational cost
- significant improvement
- clustering method
- dynamic programming
- compact representations
- genetic algorithm