Twice-Ramanujan Sparsifiers

About this video

Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Explains Twice-Ramanujan sparsifiers for graph approximation. Teaches spectral graph theory and sparsification algorithms for large-scale networks.

A 70-minute video from Microsoft Research: “Twice-Ramanujan Sparsifiers”.

Video by Microsoft Research, played through YouTube's embedded player.