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