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