Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Shah Aatif Bashir
April 22, 2023
13 hours (approximately)
Shah Aatif Bashir'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: Computational Thinking
- Category: Algorithms
- Category: Theoretical Computer Science
- Category: Data Structures
- Category: Graph Theory
- Category: Network Routing
