An edge-swap heuristic for generating spanning trees with minimum number of branch vertices.
Ricardo M. A. SilvaDiego M. SilvaMauricio G. C. ResendeGeraldo R. MateusJosé Fernando GonçalvesPaola FestaPublished in: Optim. Lett. (2014)
Keyphrases
- spanning tree
- undirected graph
- edge weights
- minimum spanning trees
- minimum spanning tree
- weighted graph
- edge disjoint
- approximation algorithms
- minimum weight
- image processing
- neural network
- minimum cost
- evolutionary algorithm
- optimal solution
- small number
- tabu search
- special case
- computational complexity
- minimum total cost
- genetic algorithm