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