- 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 Dilip Kumar Verma
July 7, 2021
13 hours (approximately)
Dilip Kumar Verma'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
