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