Data StructureAlgorithmsNp-CompletenessDynamic Programming
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Gert de Pagter
April 3, 2019
4 weeks of study, 4-8 hours/week
Gert de Pagter's account is verified. Coursera certifies their successful completion of Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Skills you will gain
© 2020 Coursera Inc. All rights reserved.
