A Moderately Exponential Time Algorithm for Full Degree Spanning Tree.
Serge GaspersSaket SaurabhAlexey A. StepanovPublished in: TAMC (2008)
Keyphrases
- spanning tree
- minimum spanning tree
- objective function
- preprocessing
- linear complexity
- cost function
- learning algorithm
- dynamic programming
- detection algorithm
- probabilistic model
- average case
- np hard
- k means
- computational complexity
- worst case
- computational cost
- distance transform
- minimum cost
- undirected graph
- optimal solution
- minimum weight