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