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