Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Saeefa Rubaiyet Nowmi
August 10, 2023
13 hours (approximately)
Saeefa Rubaiyet Nowmi'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: Theoretical Computer Science
- Category: Computational Thinking
- Category: Computer Science
- Category: Network Routing
- Category: Algorithms
