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