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