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: Computational Thinking
- Category: Graph Theory
- Category: Computer Science
- Category: Algorithms
- Category: Theoretical Computer Science
- Category: Network Routing
- Category: Data Structures
