Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Gert de Pagter
April 3, 2019
13 hours (approximately)
Gert de Pagter'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
- Category: Theoretical Computer Science
- Category: Algorithms
- Category: Data Structures
- Category: Graph Theory
- Category: Network Routing
- Category: Computer Science
- Category: Computational Thinking
