Module #19 Scheduling and Resource Allocation Graph-based scheduling algorithms and resource allocation problems
Module #20 Computational Complexity of Graph Algorithms NP-completeness, hardness of approximation, and efficient algorithms for graph problems
Module #21 Approximation Algorithms for Graph Problems Approximation algorithms for NP-hard graph problems, such as vertex cover and traveling salesman
Module #22 Online and Dynamic Graph Algorithms Algorithms for dynamic graphs, online algorithms, and streaming graph algorithms
Module #23 Distributed Graph Algorithms Algorithms for distributed graph processing, parallel algorithms, and distributed graph systems
Module #24 Course Wrap-Up & Conclusion Planning next steps in Graph Algorithms and Applications career