Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Garrett Hughes
December 26, 2019
13 hours (approximately)
Garrett Hughes'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
- Category: Data Structures
- Category: Graph Theory
- Category: Theoretical Computer Science
- Category: Computational Thinking
- Category: Computer Science
- Category: Network Routing
- Category: Algorithms
