- Theoretical Computer Science
- Data Structures
- Computational Thinking
- Graph Theory
- Algorithms
- Pseudocode
- Operations Research
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by HOÀNG QUÂN TRẦN
November 3, 2024
13 hours (approximately)
HOÀNG QUÂN TRẦN'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
