Lower bound for the cost of connecting tree with given vertex degree sequence.

Mikhail V. Goubko Alexander V. Kuznetsov

Published in: J. Complex Networks (2020)

Keyphrases

lower bound
upper bound
optimal cost
branch and bound algorithm
objective function
branch and bound
lower and upper bounds
total cost
worst case
lower bounding
sufficiently accurate
np hard
optimal solution
b tree
minimum cost
tree nodes
storage space
directed graph
expected cost
binary tree
index structure