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

Completed by Matias Jose Agelvis Dominguez

November 29, 2019

13 hours (approximately)

View certificate for Matias Jose Agelvis Dominguez, Shortest Paths Revisited, NP-Complete Problems and What To Do About Them, an online non-credit course authorized by Stanford University and offered through Coursera