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