A complete spanning tree maintenance algorithm and its complexity.
Akinori SaitohYoshihiro TsujinoNobuki TokuraPublished in: Systems and Computers in Japan (1992)
Keyphrases
- spanning tree
- worst case
- computational complexity
- search space
- space complexity
- minimum spanning tree
- computational cost
- detection algorithm
- dynamic programming
- learning algorithm
- simulated annealing
- matching algorithm
- cost function
- k means
- preprocessing
- objective function
- ant colony optimization
- memory requirements
- search tree
- graph structure
- undirected graph