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