Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Completed by Jan Willeboord Schaaf
March 28, 2020
13 hours (approximately)
Jan Willeboord Schaaf'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
