A bottleneck edge is the highest weighted edge in a spanning tree.
A spanning tree is a minimum bottleneck spanning tree (or MBST) if the graph does not contain a spanning tree with a smaller bottleneck edge weight.
A MST is necessarily a MBST (provable by the cut property), but a MBST is not necessarily a MST.
Read more about this topic: Minimum Spanning Tree
Famous quotes containing the words minimum and/or tree:
“After decades of unappreciated drudgery, American women just dont do housework any morethat is, beyond the minimum that is required in order to clear a path from the bedroom to the front door so they can get off to work in the mourning.”
—Barbara Ehrenreich (20th century)
“On a tree by a river a little tom-tit Sang Willow, titwillow, titwillow!
And I said to him, Dicky-bird, why do you sit Singing, Willow, titwillow, titwillow!”
—Sir William Schwenck Gilbert (18361911)