An Algorithm to Find Optimal Independent Spanning Trees on Twisted-Cubes.
Yan WangJianxi FanYuejuan HanPublished in: PAAP (2011)
Keyphrases
- spanning tree
- dynamic programming
- optimal solution
- learning algorithm
- worst case
- minimum spanning tree
- np hard
- preprocessing
- detection algorithm
- computational cost
- segmentation algorithm
- genetic algorithm
- times faster
- closed form
- particle swarm optimization
- cost function
- objective function
- optimization algorithm
- matching algorithm
- exhaustive search
- globally optimal
- multi dimensional
- data warehouse
- k means
- similarity measure
- neural network
- greedy heuristic