- Data Structures
- Pseudocode
- Theoretical Computer Science
- Algorithms
- Computational Thinking
- Operations Research
- Graph Theory
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Alexandre de Chaumont de Quitry
December 7, 2023
13 hours (approximately)
Alexandre de Chaumont de Quitry'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
