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