#minimum_bottleneck_spanning_tree
Minimum bottleneck spanning tree
In mathematics, a minimum bottleneck spanning tree (MBST) in an undirected graph is a spanning tree 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).
Mon 29th
Provided by Wikipedia
This keyword could refer to multiple things. Here are some suggestions:
Minimum bottleneck spanning tree Minimum spanning tree Widest path problem List of NP-complete problems List of graph theory topics Matroid-constrained number partitioning Disparity filter algorithm of weighted network List of terms relating to algorithms and data structures Travelling salesman problem K-set (geometry)
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.