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