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