Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Analysis of Algorithms Max Alekseyev
 

Summary: 1/21
Analysis of Algorithms
Lecture 22
Max Alekseyev
University of South Carolina
December 2, 2010
2/21
Outline
Minimum Spanning Tree
Generic MST Algorithm
Kruskal's Algorithm
Prim's Algorithm
3/21
Minimum Spanning Tree
Problem:
A town has a set of houses and a set of roads.
A road connects 2 and only 2 houses.
A road connecting houses u and v has a repair cost w(u, v).
Goal: Repair enough (and no more) roads such that
1. everyone stays connected: can reach every house from all other

  

Source: Alekseyev, Max - Department of Computer Science and Engineering, University of South Carolina

 

Collections: Biotechnology; Computer Technologies and Information Sciences