Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Jitender Singh Shekhawat
March 1, 2021
13 hours (approximately)
Jitender Singh Shekhawat'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: Theoretical Computer Science
- Category: Graph Theory
- Category: Computational Thinking
- Category: Algorithms
- Category: Network Routing
- Category: Data Structures
- Category: Computer Science
