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