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