Loading repovive.com/roadmaps/graph-problem-solving
Roadmaps
Graph: Problem Solving
Premium
Centroid Decomposition
Problemset
Discussion
AI Helper
Getting Started
0/4
Shortest Path Variants
0/30
Grid Graphs
0/33
Connectivity (DSU and DFS)
0/27
DAG and Topological Sort
0/28
Tree Algorithms
0/39
Centroid Decomposition
0/30
1
Introduction to Centroid Decomposition
2
What Centroid Decomposition Solves
3
When to Use Centroid Decomposition
4
Centroid Decomposition Template
5
When Centroid Decomposition Helps
6
Problem - IOI Race
7
IOI Race - Why Naive Fails
8
IOI Race - Defining the DP
9
IOI Race - Implementation
10
IOI Race - Time and Space
11
Problem - Distance in Tree
12
Distance in Tree - Why Naive Fails
13
Distance in Tree - Defining the DP
14
Distance in Tree - Core Logic
15
Distance in Tree - Implementation
16
Problem - Xenia and Tree
17
Xenia and Tree - Why Naive Fails
18
Xenia and Tree - Defining the DP
19
Xenia and Tree - Core Logic
20
Xenia and Tree - Implementation
21
Problem - Close Vertices
22
Close Vertices - Solution
23
Quiz: Centroid Properties
24
Quiz: Counting Paths
25
Common Mistakes in Centroid Decomposition
26
Problem - Digit Tree
27
Digit Tree - Solution
28
Problem - Query on a Tree V
29
Query on a Tree V - Solution
30
Section Recap
7.1
Introduction to Centroid Decomposition
4 minutes
100%
Premium Roadmap
You're previewing free content. Unlock all units to continue learning.
Subscribe
Tasks
Read Unit