WIS in Path Graphs: Optimal Substructure

Loading...
From the course by Stanford University
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
557 ratings
Stanford University
557 ratings
Course 3 of 4 in the Specialization Algorithms

Meet the Instructors

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.