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