Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Siddharth Singh
June 5, 2017
13 hours (approximately)
Siddharth Singh'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
