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