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