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