Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,017,902 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Algorithm
Dijkstra's algorithm
Fibonacci heap
Minimum spanning tree
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
REVIEW : — Parallel Computing Approach of the Reverse-Delete Algorithm for finding Minimum Bottleneck Spanning Tree and Minimum Spanning Trees —
Ahmad Traboulsi
2015
Corpus ID: 16852947
The world of computing lead people to the thinking of optimizing all the solutions, i.e. finding the best solution to a problem…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE