| parent,child |
| Advanced Topics in Computer Algorithms,Graph Algorithms |
| Graph Algorithms,Bipartite Graphs |
| Bipartite Graphs,Bipartite Graph Definition |
| Bipartite Graphs,Stable Matching Application |
| Bipartite Graphs,Odd-Length Cycle Absence |
| Bipartite Graphs,Breadth-First Search (BFS) Layering |
| Graph Algorithms,Directed Graphs |
| Directed Graphs,Data Structure Representations |
| Data Structure Representations,Adjacency Matrix |
| Graph Algorithms,Directed Acyclic Graphs (DAGs) |
| Directed Acyclic Graphs (DAGs),Topological Ordering |
| Directed Acyclic Graphs (DAGs),Nodes without Entering Edges |
| Graph Algorithms,Shortest Path Problem |
| Shortest Path Problem,Single-Pair Shortest Path |
| Shortest Path Problem,Single-Source Shortest Path |
| Shortest Path Problem,Dijkstra's Algorithm |
| Graph Algorithms,Minimum Spanning Trees (MST) |
| Advanced Topics in Computer Algorithms,Greedy Algorithms |
| Greedy Algorithms,Interval Scheduling Problem |
| Interval Scheduling Problem,Mutually Compatible Jobs |
| Interval Scheduling Problem,Earliest-Finish-Time-First Algorithm |
| Greedy Algorithms,Interval Partitioning |
| Interval Partitioning,Interval Depth and Classroom Allocation |
| Interval Partitioning,Earliest-Start-Time-First Algorithm |
| Interval Scheduling Problem,Starting and Finishing Times |
| Interval Scheduling Problem,Algorithm Optimality |
| Greedy Algorithms,Minimizing Lateness |
| Minimizing Lateness,Processing Time and Due Time |
| Minimizing Lateness,Idle Time |
| Minimizing Lateness,Inversions of minimizing lateness |
| Minimizing Lateness,Earliest-Deadline-First Strategy |
| Advanced Topics in Computer Algorithms,Divide and Conquer |
| Divide and Conquer,Mergesort Algorithm |
| Mergesort Algorithm,Left and Right Halves |
| Mergesort Algorithm,Sorted List Merging |
| Mergesort Algorithm,time complexity of Mergesort Algorithm |
| Divide and Conquer,Integer Multiplication |
| Divide and Conquer,matrix multiplication |
| matrix multiplication,Adjacency Matrix |
| matrix multiplication,block partitioning |
| matrix multiplication,Sub-matrix Multiplications |
| Divide and Conquer,Master Theorem |
| Divide and Conquer,core process of divide and conquer |
| core process of divide and conquer,divide |
| core process of divide and conquer,conquer |
| core process of divide and conquer,combine |
| Advanced Topics in Computer Algorithms,Dynamic Programming |
| Dynamic Programming,core concepts of dynamic programming |
| core concepts of dynamic programming,Overlapping Subproblems |
| core concepts of dynamic programming,Optimal Substructure |
| Optimal Substructure,Data Structure Representations |
| core concepts of dynamic programming,Bellman Equation |
| Dynamic Programming,applications of dynamic programming |
| applications of dynamic programming,Interval Scheduling Problem |
| applications of dynamic programming,Subset Sum Problem |
| applications of dynamic programming,Knapsack Problem |
| applications of dynamic programming,Longest Common Subsequence (LCS) |
| applications of dynamic programming,Shortest Path Problem |
| Advanced Topics in Computer Algorithms,NP-Completeness |
| NP-Completeness,Problem Classifications of NP-completeness |
| Problem Classifications of NP-completeness,Decision Problem |
| Problem Classifications of NP-completeness,Search Problem |
| Problem Classifications of NP-completeness,Optimization Problem |
| Search Problem,Breadth-First Search (BFS) Layering |
| Optimization Problem,Optimal Substructure |
| NP-Completeness,Complexity Classes |
| Complexity Classes,P (Polynomial Time) |
| Complexity Classes,NP (Nondeterministic Polynomial Time) |
| Complexity Classes,EXP (Exponential Time) |
| Complexity Classes,NP-Completeness |
| NP-Completeness,Polynomial-Time Reductions |
| Polynomial-Time Reductions,Reduction Strategies |
| Polynomial-Time Reductions,Specific Reductions |
| NP-Completeness,Core NP Problems |
| Core NP Problems,Travelling Salesman Problem (TSP) |
| Core NP Problems,graph problems |
| graph problems,Bipartite Graphs |
| Core NP Problems,Set Cover problems |
| NP-Completeness,Reduction Purposes |
| Reduction Purposes,Algorithm Optimality |
| extended NP-complete problems,Knapsack Problem |
| extended NP-complete problems,Subset Sum Problem |
| extended NP-complete problems,Problem Classifications of NP-completeness |
| Problem Classifications of NP-completeness,extended NP-complete problems |
| Advanced Topics in Computer Algorithms,Approximation Algorithms |
| Approximation Algorithms,Algorithm Design Techniques |
| Algorithm Design Techniques,Greedy Algorithms |
| Algorithm Design Techniques,Dynamic Programming |
| Algorithm Design Techniques,Linear Programming |
| Algorithm Design Techniques,Polynomial-Time Approximation Scheme (PTAS) |
| Polynomial-Time Approximation Scheme (PTAS),Polynomial-Time Reductions |
| Approximation Algorithms,Knapsack Problem |
| Approximation Algorithms,Travelling Salesman Problem (TSP) |
| Approximation Algorithms,Vertex Cover Problem |
| Approximation Algorithms,Set Cover problems |
| Vertex Cover Problem,Unweighted Vertex Cover |
| Vertex Cover Problem,Weighted Vertex Cover |
| Advanced Topics in Computer Algorithms,Online Algorithms |
| Online Algorithms,Competitive Ratio (Worst-Case Guarantee) |
| Online Algorithms,Ski-Rental Problem |
| Online Algorithms,Online Bipartite Matching |
| Online Bipartite Matching,Greedy Algorithms |
| Online Algorithms,Online Scheduling Problem |
| Online Algorithms,Online Stochastic Decision-Making |
| Mergesort Algorithm,Algorithm Design Techniques |
|
|
