PK

PKBytes

HomeLearnTechnology
Explore tracks
Chapter 42: Advanced Tree Algorithms on Graphs
← All DSA chapters

Part VI · Chapter 42

Advanced Tree Algorithms on Graphs
  1. 42.01LCA fundamentals
  2. 42.02Tree distances and paths
  3. 42.03Euler tours
  4. 42.04Binary lifting extensions
  5. 42.05Tree DP
  6. 42.06Rerooting DP
  7. 42.07Heavy-light decomposition
  8. 42.08Centroid decomposition
  9. 42.09DSU on tree
  10. 42.10Virtual trees
  11. 42.11Tree isomorphism intro
    1. Rooted tree canonical forms
    2. AHU hashing idea
    3. Unrooted center reduction
← All DSA chapters

Part VI · Chapter 42

Advanced Tree Algorithms on Graphs
  1. 42.01LCA fundamentals
  2. 42.02Tree distances and paths
  3. 42.03Euler tours
  4. 42.04Binary lifting extensions
  5. 42.05Tree DP
  6. 42.06Rerooting DP
  7. 42.07Heavy-light decomposition
  8. 42.08Centroid decomposition
  9. 42.09DSU on tree
  10. 42.10Virtual trees
  11. 42.11Tree isomorphism intro
    1. Rooted tree canonical forms
    2. AHU hashing idea
    3. Unrooted center reduction
Home/DSA/Advanced Tree Algorithms on Graphs/Tree isomorphism intro
42.11Intermediate / Advanced3 topics

Tree isomorphism intro

Part of Chapter 42: Advanced Tree Algorithms on Graphs.

Outline only

The topics below come from the curriculum. Their written explanations and animations have not been published yet.

42.11.1

Rooted tree canonical forms

Explanation coming soon.

42.11.2

AHU hashing idea

Explanation coming soon.

42.11.3

Unrooted center reduction

Explanation coming soon.

← Previous · 42.10

Virtual trees

Next · 43.01 →

Knapsack taxonomy

On this page

  • Rooted tree canonical forms
  • AHU hashing idea
  • Unrooted center reduction