Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Minimum bottleneck spanning tree
open-in-new
<p>In mathematics, a minimum bottleneck spanning tree (MBST) in an undirected graph is a <a href="/facts/Spanning_tree/qQPN9taR">spanning tree</a> in which the most expensive edge is as cheap as possible. A bottleneck edge is the highest weighted edge in a spanning tree. A spanning tree is a minimum bottleneck spanning tree if the graph does not contain a spanning tree with a smaller bottleneck edge weight. For a directed graph, a similar problem is known as Minimum Bottleneck Spanning Arborescence (MBSA). </p>