Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by LONG THANH LE
February 16, 2025
13 hours (approximately)
LONG THANH LE'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: Algorithms
- Category: Network Routing
- Category: Computational Thinking
- Category: Data Structures
- Category: Computer Science
- Category: Graph Theory
- Category: Theoretical Computer Science
