A new algorithm for minimum spanning tree using depth-first-search in an undirected graph.
H. Salehi FathabadiH. AhrabianPublished in: Int. J. Comput. Math. (1995)
Keyphrases
- spanning tree
- minimum spanning tree
- depth first search
- undirected graph
- breadth first search
- objective function
- minimum weight
- linear programming
- particle swarm optimization
- steiner tree
- edge weights
- search tree
- ant colony optimization
- np hard
- search space
- traveling salesman problem
- benchmark problems
- approximation algorithms
- minimum cost
- shortest path
- routing problem
- segmentation algorithm
- worst case
- knn
- tree search
- state space
- social networks