Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Karan Singh Bharaj
February 14, 2020
13 hours (approximately)
Karan Singh Bharaj'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: Theoretical Computer Science
- Category: Computer Science
- Category: Algorithms
- Category: Network Routing
- Category: Graph Theory
