Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Fernando Jascovich
August 12, 2017
13 hours (approximately)
Fernando Jascovich'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: Graph Theory
- Category: Network Routing
- Category: Computer Science
- Category: Computational Thinking
- Category: Algorithms
