Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Nguyen Quang Minh
June 6, 2022
13 hours (approximately)
Nguyen Quang Minh'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: Network Routing
- Category: Algorithms
- Category: Computer Science
