MSTs: State-of-the-Art and Open Questions [Advanced - Optional]

Loading...
From the course by Stanford University
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
250 ratings
Stanford University

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

250 ratings
Course 3 of 4 in the Specialization Algorithms

Meet the Instructors

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science