Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Tanay Kadam
February 27, 2024
13 hours (approximately)
Tanay Kadam'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
