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