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