Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Thành Nguyễn
September 15, 2019
13 hours (approximately)
Thành Nguyễn'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: Theoretical Computer Science
- Category: Computer Science
- Category: Computational Thinking
- Category: Algorithms
- Category: Data Structures
- Category: Network Routing
