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