- Theoretical Computer Science
- Operations Research
- Pseudocode
- Algorithms
- Graph Theory
- Data Structures
- Computational Thinking
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Sam Zilli
June 15, 2022
13 hours (approximately)
Sam Zilli'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
