Designing an Algorithm to Improve the Diameters of Completely Independent Spanning Trees in Crossed Cubes.
Kung-Jui PaiPublished in: ICS (2018)
Keyphrases
- spanning tree
- computational complexity
- detection algorithm
- optimal solution
- similarity measure
- computational cost
- preprocessing
- dynamic programming
- expectation maximization
- np hard
- search space
- learning algorithm
- cost function
- objective function
- probabilistic model
- worst case
- simulated annealing
- segmentation algorithm
- times faster
- machine learning
- multimedia
- random walk
- matching algorithm
- convergence rate
- genetic algorithm