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