Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees.
Toru HasunumaPublished in: IWOCA (2015)
Keyphrases
- spanning tree
- minimum cost
- edge disjoint
- minimum spanning tree
- completely independent
- minimum spanning trees
- undirected graph
- np hard
- minimum weight
- minimum total cost
- approximation algorithms
- single parameter
- machine learning
- edge weights
- upper bound
- root node
- dynamic programming
- optimal solution
- sufficient conditions
- worst case
- depth first search