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