Unformatted text preview: edges (all costs > 0). Now we construct a new graph G ′ , which is the same as G , except for the costs. The cost of an edge e is deFned to be 1 /c e where c e is the cost of e in G . 1. Is the Minimum cost spanning tree in G , the Maximum cost spanning tree in G ′ ? Prove or disprove. 2. Suppose that P is the shortest path from s to v in G . Is P the longest simple path from s to v in G ′ ? Prove, or disprove. Problem 4. Do Exercise 16 on pages 196-197 of Kleinberg and Tardos. 1...
View Full Document
- Fall '08
- Graph Theory, G′, Clyde Kruskal, new graph G′