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