Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Robert Archibald Dobbin III
February 1, 2017
13 hours (approximately)
Robert Archibald Dobbin III'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: Theoretical Computer Science
- Category: Algorithms
- Category: Network Routing
- Category: Data Structures
- Category: Graph Theory
