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