Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Sachin Gopal Wani
March 9, 2019
13 hours (approximately)
Sachin Gopal Wani'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: Data Structures
- Category: Graph Theory
- Category: Computer Science
- Category: Algorithms
- Category: Theoretical Computer Science
- Category: Network Routing
