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