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