Minimum bottleneck spanning trees with degree bounds.
Patrick J. AndersenCharl J. RasPublished in: Networks (2016)
Keyphrases
- spanning tree
- edge disjoint
- minimum cost
- minimum spanning tree
- upper bound
- minimum spanning trees
- total length
- minimum total cost
- lower bound
- average case
- undirected graph
- root node
- depth first search
- high level
- edge weights
- upper and lower bounds
- lower and upper bounds
- np hard
- leaf nodes
- lowest cost
- data structure
- multimedia