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