Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Rahul Patel
January 16, 2017
13 hours (approximately)
Rahul Patel'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: Graph Theory
- Category: Theoretical Computer Science
- Category: Computational Thinking
- Category: Computer Science
- Category: Network Routing
- Category: Algorithms
