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