Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Carl Colijn
June 21, 2018
13 hours (approximately)
Carl Colijn'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
