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