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:
“There are ... two minimum conditions necessary and sufficient for the existence of a legal system. On the one hand those rules of behavior which are valid according to the system’s ultimate criteria of validity must be generally obeyed, and on the other hand, its rules of recognition specifying the criteria of legal validity and its rules of change and adjudication must be effectively accepted as common public standards of official behavior by its officials.”
—H.L.A. (Herbert Lionel Adolphus)
“Strong to break dead things,
the young tree, drained of sap,
the old tree, ready to drop,
to lift from the rotting bed
of leaves, the old
crumbling pine tree stock.”
—Hilda Doolittle (1886–1961)