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