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