# CSE3500 - HW4.pdf - CSE 3500 Algorithms and Complexity...

• No School
• AA 1
• 1

This preview shows page 1 out of 1 page.

CSE 3500 Algorithms and Complexity February 23, 2016 Homework 4 1. (K&T Ch. 4 question 8) Suppose you are given a connected graph G with edge costs that are all distinct. Prove that G has a unique minimum spanning tree. 2. Suppose we have a graph G , where all but two of the edges have distinct weights – that is, two edges have the same weight, and all of the others are distinct. Which of these is true: a) G has a unique MST, b) G has more than one MSTs, or c) Sometimes G has a single MST, sometimes G has more than 1 MST. Prove your answer is correct. 3. A Minimum-Bottleneck Spanning Tree (MBST) is a spanning tree of a connected undirected graph with positive edge weights chosen so its maximum edge weight is as small as possible.
• Fall '19
• Graph Theory, Planar graph, Vertex-transitive graph, graph G

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern

Ask Expert Tutors You can ask 0 bonus questions You can ask 0 questions (0 expire soon) You can ask 0 questions (will expire )
Answers in as fast as 15 minutes