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