This preview shows page 1. Sign up to view the full content.
Unformatted text preview: k red edges, and there is a spanning tree T with k red edges. Show that for all k , k k k there is a spanning tree with exactly k red edges. 3). (AMO 13.34) We are given an undirected, connected graph G = ( V,E ) with (nonnegative) weightss on the edges w ij . A balanced spanning tree is dened as a spanning tree of G if from among all spanning trees of G the dierence between the maximum edge weight and the minimum edge weight is as small as possible. Describe a polynomial time algorithm for nding a balanced spanning tree. Make sure to state the running time of your algorithm....
View Full Document
- Fall '08