A Distributed Algorithm for Computing a Spanning Tree in Anonymous Tprime Graph.
Yves MétivierMohamed MosbahPierre-André WacrenierStefan GrunerPublished in: OPODIS (2001)
Keyphrases
- spanning tree
- minimum spanning tree
- minimum cost
- dynamic programming
- edge disjoint
- minimum weight
- undirected graph
- objective function
- minimum spanning trees
- weighted graph
- graph structure
- distributed systems
- k means
- segmentation algorithm
- detection algorithm
- graph theory
- worst case
- depth first search
- search space
- random walk
- simulated annealing
- np hard
- maximum flow
- computational complexity
- learning algorithm