To get a minimum spanning tree, instead of adding shortest
Chapter 23, Problem 23.4(choose chapter or problem)
To get a minimum spanning tree, instead of adding shortest edges, one could think of deleting longest edges. For what graph5 would this be feasible? Describe an algorithm for this.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer