Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm.
Leonardo Conegundes MartinezAlexandre Salles da CunhaPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- spanning tree
- detection algorithm
- minimum spanning tree
- preprocessing
- computational cost
- experimental evaluation
- optimal solution
- cost function
- learning algorithm
- times faster
- expectation maximization
- dynamic programming
- worst case
- probabilistic model
- clustering method
- particle swarm optimization
- np hard
- computational complexity
- objective function
- high accuracy
- k means
- optimization algorithm
- search space
- high dimensional
- ant colony optimization
- matching algorithm
- spectral clustering
- recognition algorithm
- similarity measure