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