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