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

Completed by Abhisek Ganguly

May 31, 2022

13 hours (approximately)

View certificate for Abhisek Ganguly, Shortest Paths Revisited, NP-Complete Problems and What To Do About Them, an online non-credit course authorized by Stanford Online and offered through Coursera