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