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