Lectures related to AVL tree | EPFL Graph Search

Explores hashing techniques like static, extendible, and linear hashing, along with sorting methods such as external merge sort and B+ trees.

Explores counting labeled trees using Prüfer codes and algorithms, providing maps between trees and sequences.

Explores automorphism groups of trees and graphs, including actions on trees and group homomorphisms.

Covers graph properties, representations, and traversal algorithms using BFS and DFS.

Explores language detection using Recurrent Neural Networks and supervised learning concepts.

Covers embedding graphs into trees with a focus on minimizing distortion and Bartal Tree embeddings.