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