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