Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Akash Chaudhary
June 8, 2018
13 hours (approximately)
Akash Chaudhary'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: Algorithms
- Category: Data Structures
- Category: Graph Theory
- Category: Theoretical Computer Science
- Category: Computer Science
- Category: Network Routing
