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