- 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 YAMAN AYUSH
June 14, 2023
13 hours (approximately)
YAMAN AYUSH'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
