Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by 轶凡 å¼
February 24, 2018
13 hours (approximately)
轶凡 å¼ '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: Theoretical Computer Science
- Category: Graph Theory
- Category: Network Routing
- Category: Computer Science
- Category: Computational Thinking
- Category: Algorithms
