{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# ps1 - 6.889 Algorithms for Planar Graphs and Beyond Problem...

This preview shows page 1. Sign up to view the full content.

6.889: Algorithms for Planar Graphs and Beyond September 14, 2011 Problem Set 1 This problem set is due Thursday, September 22 at noon. 1. Sparsity Lemma: Prove that for a planar a embedded graph in which every face has size at least three, m 3 n - 6, where m is the number of edges and n is the number of vertices. 2. Minimum Spanning Tree: Give a linear-time algorithm for minimum-weight spanning tree in a connected planar graph. Refer to the textbook for a discussion of representing embedded graphs in computations and efficiently performing basic operations such as contractions and deletions. You are encouraged to use the following results, which you need not prove. Let G be a graph with edge-weights, and let v be a vertex. Let
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### 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