A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners.
Davide BilòKleitos PapadopoulosPublished in: CoRR (2018)
Keyphrases
- tree structure
- learning algorithm
- computational complexity
- cost function
- improved algorithm
- detection algorithm
- high accuracy
- significant improvement
- dynamic programming
- objective function
- probabilistic model
- experimental evaluation
- expectation maximization
- linear programming
- times faster
- segmentation algorithm
- optimization algorithm
- convergence rate
- simulated annealing
- search space
- preprocessing
- minimum spanning tree
- binary tree
- graph structure
- recognition algorithm
- neural network
- unordered trees
- matching algorithm
- theoretical analysis
- computational cost
- np hard
- optimal solution
- similarity measure
- genetic algorithm