A Maximum Degree Self-Stabilizing Spanning Tree Algorithm.
Deniz CokusluKayhan ErciyesAbdelkader HameurlainPublished in: ISCIS (2010)
Keyphrases
- spanning tree
- minimum spanning tree
- dynamic programming
- computational complexity
- preprocessing
- k means
- objective function
- detection algorithm
- computational cost
- learning algorithm
- simulated annealing
- particle swarm optimization
- expectation maximization
- segmentation algorithm
- shortest path
- matching algorithm
- knapsack problem
- cost function