Concept

Vertex separator

Related lectures (6)

Covers the topology of Riemann surfaces and the concept of triangulation using finitely many triangles.

Introduces graph sketching, generalizations like multigraphs, and weighted graphs.

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

Explores directed networks with asymmetric relationships and hypergraphs that generalize graphs by allowing edges to connect any subset of nodes.

Explores automorphisms of graphs, focusing on automorphism groups, Cayley-Abels graphs, and quasi-isometry.

Covers the Leighton-Rao algorithm for finding the sparsest cut in a graph, focusing on its steps and theoretical foundations.