Sunday, October 14, 2007

Problem 11

Consider a connected graph G whose edges have distinct costs. Denote: T1 the minimum spanning tree of G, and T2 the second cheapest spanning tree of G.
Question: T1 and T2 differ in how many edges?
Posted by at
Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)