| parent,child |
| Design and Analysis of Algorithms,Greedy Algorithms |
| Design and Analysis of Algorithms,Problem Modeling and Algorithm Design |
| Problem Modeling and Algorithm Design,Mathematical Modeling |
| Mathematical Modeling,Fibonacci Sequence |
| Problem Modeling and Algorithm Design,Handshaking Problems |
| Handshaking Problems,Proof Techniques |
| Handshaking Problems,Graph Representation |
| Problem Modeling and Algorithm Design,Stable Matching Problem |
| Design and Analysis of Algorithms,Algorithm Analysis |
| Algorithm Analysis,Complexity Measures |
| Complexity Measures,Time Complexity (Running Time) |
| Algorithm Analysis,Order of Growth |
| Algorithm Analysis,Directed Graphs |
| Directed Graphs,Graph Representation |
| Algorithm Analysis,Directed Acyclic Graphs (DAGs) |
| Algorithm Analysis,Shortest Path Problem |
| Shortest Path Problem,Single-pair |
| Shortest Path Problem,Single-source |
| Shortest Path Problem,Dijkstra's Algorithm |
| Algorithm Analysis,Minimum Spanning Trees (MST) |
| Greedy Algorithms,Interval Scheduling |
| Greedy Algorithms,Interval Partitioning |
| Greedy Algorithms,Scheduling to Minimize Lateness |
| Greedy Algorithms,Greedy Analysis Strategies |
| Greedy Analysis Strategies,Greedy Algorithm Stays Ahead |
| Greedy Analysis Strategies,Structural Bound |
| Greedy Analysis Strategies,Exchange Argument |
| Greedy Analysis Strategies,Algorithm Analysis |
| Design and Analysis of Algorithms,Divide and Conquer |
| Divide and Conquer,Algorithmic Paradigm |
| Divide and Conquer,The Mergesort Algorithm |
| The Mergesort Algorithm,Time Complexity (Running Time) |
| Divide and Conquer,Counting Inversions |
| Divide and Conquer,Integer Multiplication |
| Integer Multiplication,Grade-School Algorithm |
| Grade-School Algorithm,Algorithm Analysis |
| Integer Multiplication,Bit Complexity |
| Bit Complexity,Complexity Measures |
| Integer Multiplication,Recursive-Multiply |
| Divide and Conquer,Master Theorem |
| Fibonacci Sequence,Algorithm Analysis |
| Design and Analysis of Algorithms,Dynamic Programming |
| Dynamic Programming,Core Properties of dynamic programming |
| Core Properties of dynamic programming,Overlapping Subproblems |
| Core Properties of dynamic programming,Optimal Substructure |
| Core Properties of dynamic programming,Bellman Equation |
| Dynamic Programming,implementation of dynamic programming |
| implementation of dynamic programming,Memoization |
| implementation of dynamic programming,Iterative Algorithm |
| Dynamic Programming,Applications of dynamic programming |
| Applications of dynamic programming,Weighted Interval Scheduling Problem |
| Applications of dynamic programming,Maximum Subarray Sum |
| Applications of dynamic programming,Subset Sum Problem |
| Applications of dynamic programming,Knapsack Problem |
| Problem Modeling and Algorithm Design,Classic Optimization Problems |
| Classic Optimization Problems,Weighted Interval Scheduling Problem |
| Classic Optimization Problems,Max Contiguous Subarray |
| Classic Optimization Problems,Monotonically Increasing Subsequence |
| Classic Optimization Problems,Subset Sum Problem |
| Classic Optimization Problems,Knapsack Problem |
| Classic Optimization Problems,Shortest Path Problem |
| Design and Analysis of Algorithms,NP-Completeness |
| NP-Completeness,Problem Types |
| NP-Completeness,Classic Problems |
| NP-Completeness,Complexity Classes |
| Problem Types,decision problem |
| Problem Types,Search Problem |
| Problem Types,Classic Optimization Problems |
| Classic Problems,Travelling Salesman Problem (TSP) |
| Classic Problems,Vertex Cover |
| NP-Completeness,Polynomial-Time Reductions |
| NP-Completeness,NP-Completeness Proof Recipe |
| NP-Completeness,Core NP-Complete Problems & Reductions |
| Core NP-Complete Problems & Reductions,graph problems |
| graph problems,Vertex Cover |
| Core NP-Complete Problems & Reductions,Number and Packing Problems |
| Number and Packing Problems,Knapsack Problem |
| Number and Packing Problems,Subset Sum Problem |
| Design and Analysis of Algorithms,Approximation Algorithms |
| Approximation Algorithms,Algorithm Design Techniques |
| Algorithm Design Techniques,Greedy Algorithms |
| Algorithm Design Techniques,Dynamic Programming |
| Algorithm Design Techniques,Divide and Conquer |
| Approximation Algorithms,Knapsack Problem |
| Approximation Algorithms,Independent Set Problem |
| Independent Set Problem,Greedy Algorithms |
| Approximation Algorithms,Vertex Cover |
| Approximation Algorithms,Travelling Salesman Problem (TSP) |
| Design and Analysis of Algorithms,Online Algorithms |
| Online Algorithms,Core Principles |
| Online Algorithms,Ski-Rental Problem |
| Online Algorithms,Online Bipartite Matching |
| Online Bipartite Matching,Offline Vertices |
| Online Bipartite Matching,Arriving Vertices |
| Online Bipartite Matching,Maximum Matching |
| Online Bipartite Matching,Greedy Algorithms |
| Online Algorithms,Online Stochastic Decision-Making |
| Online Stochastic Decision-Making,Secretary Problem |
| Secretary Problem,Optimal Substructure |
| Online Stochastic Decision-Making,Prophet Inequality |
| Design and Analysis of Algorithms,Randomized Algorithms |
| Randomized Algorithms,Random Variables |
| Randomized Algorithms,Probability Fundamentals |
| Randomized Algorithms,MAX-SAT Problem |
| Randomized Algorithms,Algorithm Types |
| Algorithm Types,Las Vegas Algorithms |
| Algorithm Types,Monte Carlo Algorithms |
| Algorithm Types,Algorithm Analysis |
|
|
