A Self-stabilizing Algorithm for Finding a Spanning Tree in a Polynomial Number of Moves.
Adrian KosowskiLukasz KusznerPublished in: PPAM (2005)
Keyphrases
- spanning tree
- computational complexity
- undirected graph
- minimum spanning tree
- detection algorithm
- dynamic programming
- space complexity
- learning algorithm
- preprocessing
- minimum weight
- minimum cost
- memory requirements
- directed graph
- worst case
- np hard
- search space
- optimal solution
- binary images
- special case
- k means
- running times