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