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