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