Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Christoph Meier
October 25, 2018
13 hours (approximately)
Christoph Meier'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: Data Structures
- Category: Theoretical Computer Science
- Category: Algorithms
- Category: Graph Theory
- Category: Computational Thinking
- Category: Computer Science
- Category: Network Routing
