Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Juan Humberto Ibarra López
July 3, 2019
13 hours (approximately)
Juan Humberto Ibarra López'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: Algorithms
- Category: Computational Thinking
- Category: Computer Science
- Category: Theoretical Computer Science
- Category: Graph Theory
- Category: Network Routing
- Category: Data Structures
