Application to Clustering

From the course by Stanford University
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
401 ratings
Stanford University
401 ratings
Course 3 of 4 in the Specialization Algorithms
From the lesson
Week 2
Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).

Meet the Instructors

  • Tim Roughgarden
    Tim Roughgarden
    Computer Science