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