Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by SAYANTAN CHAKRABARTI
May 20, 2023
13 hours (approximately)
SAYANTAN CHAKRABARTI'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
