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