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 don’t do housework any more—that 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)
“Here is a hero who did nothing but shake the tree as soon as the fruit was ripe. Does this seem to be too small a thing to you? Then take a good look at the tree he shook.”
—Friedrich Nietzsche (1844–1900)