Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Randy James Ray
April 30, 2018
13 hours (approximately)
Randy James Ray'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: Algorithms
- Category: Network Routing
- Category: Data Structures
- Category: Graph Theory
- Category: Theoretical Computer Science
