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