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