Problems

• Problem L - Let there be rainbows!
• Query on a tree
• Monopoly

Implementations

• Heavy-light decomposition implementation by Al.Cash (C++)
• Heavy-light tree decomposition for vertices or edges by indy256 (Java)

See also

• Centroid decomposition

External links

• Heavy-light decomposition
• Solution to Problem L – Let there be rainbows!
• Heavy Light Decomposition
• Heavy path decomposition
• Heavy-light decomposition - it can be simple!
• Heavy-light декомпозиция
• Heavy Light Decomposition | Set 1 (Introduction)
• Heavy Light Decomposition | Set 2 (Implementation)