[Solved]Let S Call Max Weight Spanning Tree T Maximum Weight Edges T Bottleneck Spanning Tree T Sp Q37125927

Bottle Neck Spanning Tree Problem

Let’s call the max-weight of a spanning tree T the maximum weight of the edges of T. A bottleneck spanning tree T is a spanning tree with the smallest max-weight. We say that the value of the bottleneck spanning tree is the weight of the maximum-weight edge in the tree. (a) [10 pts] Prove that a minimum spanning tree is a bottleneck spanning tree. (Hint: one approach is to prove by contradiction. Assume that the MST is not a bottleneck spanning tree, and then show (or construct) a spanning tree that has weight smaller than the MST, which leads to a contradiction.) (b) [10 pts] Give a linear-time algorithm that given a graph G and an integer b, determines whether the value of the bottleneck spanning tree is at most b. Your algorithm should be in pseudo code. Show transcribed image text Let’s call the max-weight of a spanning tree T the maximum weight of the edges of T. A bottleneck spanning tree T is a spanning tree with the smallest max-weight. We say that the value of the bottleneck spanning tree is the weight of the maximum-weight edge in the tree. (a) [10 pts] Prove that a minimum spanning tree is a bottleneck spanning tree. (Hint: one approach is to prove by contradiction. Assume that the MST is not a bottleneck spanning tree, and then show (or construct) a spanning tree that has weight smaller than the MST, which leads to a contradiction.) (b) [10 pts] Give a linear-time algorithm that given a graph G and an integer b, determines whether the value of the bottleneck spanning tree is at most b. Your algorithm should be in pseudo code.

Expert Answer

---

Answer to Let’s call the max-weight of a spanning tree T the maximum weight of the edges of T. A bottleneck spanning tree T is a s… . . .