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