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