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