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