Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by MOHAMMAD ESMAEILI
September 7, 2025
13 hours (approximately)
MOHAMMAD ESMAEILI'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: Algorithms
- Category: Data Structures
- Category: Graph Theory
- Category: Theoretical Computer Science
- Category: Computational Thinking
- Category: Computer Science
