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