Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

share ›
‹ links

Below are the top discussions from Reddit that mention this online Coursera course from Stanford University.

Offered by Stanford University. The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, ... Enroll for free.

Reddsera may receive an affiliate commission if you enroll in a paid course after using these buttons to visit Coursera. Thank you for using these buttons to support Reddsera.

Taught by
Tim Roughgarden
and 13 more instructors

Offered by
Stanford University

Reddit Posts and Comments

0 posts • 1 mentions • top 1 shown below

r/OMSCS • post
39 points • ChuckStrange
Algorithms courses - prep for Graduate Algorithms

There are some good online algorithms that explore algorithms, including graphs (Coursera - Stanford and Princeton algorithms courses). They are good courses, and you can download the slides for offline reading - I recommend them when you have spare time.

The Princeton course has two parts:

The Stanford algorithms specialization has four courses: