Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Sameer Marathe
February 15, 2019
13 hours (approximately)
Sameer Marathe'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: Computer Science
- Category: Computational Thinking
- Category: Data Structures
- Category: Theoretical Computer Science
- Category: Graph Theory
- Category: Algorithms
- Category: Network Routing
