On the Complexity of a Self-Stabilizing Spanning Tree Algorithm for Large Scale Systems.
Julien ClémentThomas HéraultStéphane MessikaOlivier PeresPublished in: PRDC (2008)
Keyphrases
- spanning tree
- worst case
- minimum spanning tree
- computational complexity
- space complexity
- learning algorithm
- np hard
- dynamic programming
- computational cost
- cost function
- lower bound
- memory requirements
- detection algorithm
- probabilistic model
- edge disjoint
- distance transform
- segmentation algorithm
- particle swarm optimization
- simulated annealing
- special case
- optimal solution
- objective function
- similarity measure