Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Alexander Alexandrovich Prokhorov
March 18, 2018
13 hours (approximately)
Alexander Alexandrovich Prokhorov'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: Computational Thinking
- Category: Computer Science
- Category: Graph Theory
- Category: Theoretical Computer Science
- Category: Algorithms
- Category: Data Structures
