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