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