Login / Signup
Degree bounded bottleneck spanning trees in three dimensions.
Patrick J. Andersen
Charl J. Ras
Published in:
J. Comb. Optim. (2020)
Keyphrases
</>
spanning tree
edge disjoint
minimum spanning tree
minimum cost
minimum weight
minimum spanning trees
total length
undirected graph
objective function
weighted graph
depth first search
root node
edge weights
minimum total cost