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