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