Posted by: atri | November 2, 2012

Lect 26: Minimum Spanning Tree problem

In today’s lecture, we saw the minimum spanning tree problem and considered three natural greedy algorithms: Kruskal’s algorithm, Prim’s algorithm and the Reverse-Delete algorithm. Next lecture, we will prove the correctness of Kruskal’s and Prim’s algorithms. All this material is from Section 4.5 in the book.

The slides and notes have been uploaded.

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: