Skip to content

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

Explains Twice-Ramanujan sparsifiers for efficient graph representation. Teaches spectral methods and approximation algorithms for network problems.

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