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