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