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