Minimum bottleneck spanning tree

A **Minimum Bottleneck Spanning Tree (MBST)** is a specific kind of spanning tree from a weighted graph. In the context of graph theory, a spanning tree of a graph is a subgraph that includes all the vertices of the graph and is a tree (i.e., it is connected and contains no cycles). The **bottleneck** of a spanning tree is defined as the maximum weight of the edges included in that tree.