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