Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Eyyüp Kalan
February 8, 2026
13 hours (approximately)
Eyyüp Kalan'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: Theoretical Computer Science
- Category: Graph Theory
- Category: Data Structures
- Category: Algorithms
- Category: Computer Science
- Category: Network Routing
