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