A Divide-and-Conquer Algorithm for All Spanning Tree Generation.
Maumita ChakrabortyRanjan MeheraRajat Kumar PalPublished in: ACSS (1) (2016)
Keyphrases
- spanning tree
- minimum spanning tree
- detection algorithm
- computational cost
- np hard
- k means
- preprocessing
- minimum weight
- expectation maximization
- computational complexity
- optimal solution
- generation algorithm
- objective function
- cost function
- dynamic programming
- learning algorithm
- simulated annealing
- minimum spanning trees
- undirected graph
- graphical models
- probabilistic model