- Theoretical Computer Science
- Data Structures
- Computational Thinking
- Graph Theory
- Algorithms
- Pseudocode
- Operations Research
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by thai H nguyen
April 16, 2021
13 hours (approximately)
thai H nguyen'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
