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