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: Data Structures
- Category: Theoretical Computer Science
- Category: Algorithms
- Category: Graph Theory
- Category: Computational Thinking
- Category: Computer Science
- Category: Network Routing
