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