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