- Computational Thinking
- Pseudocode
- Algorithms
- Graph Theory
- Theoretical Computer Science
- Data Structures
- Operations Research
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Nguyễn Gia Bách
December 11, 2022
13 hours (approximately)
Nguyễn Gia Bách'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
