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