Posted by: atri | October 30, 2011

Lect 25: Minimum Spanning Tree Problem

On Friday, we introduced the Minimum Spanning Tree problem and considered three greedy algorithms: Reverse-Delete, Prim’s and Kruskal’s algorithm. Tomorrow, we will start proving the correctness of Prim’s and Kruskal’s algorithms. The material is from Sec 4.5 in the book.

The slides have been uploaded.

Below are links to the student posts for the lecture:

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Categories

%d bloggers like this: