Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Siya singh
April 24, 2023
13 hours (approximately)
Siya singh'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: Network Routing
- Category: Computational Thinking
- Category: Computer Science
