Spectral graph sparsification Part 2: [An O(mlog^2 n) algorithm for solving SDD systems]
Why it's on BrighterTube
Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidenceCovers spectral graph sparsification and algorithms for solving symmetric diagonally dominant systems. Teaches mathematical methods and their computational efficiency gains.
What you'll learn
A 63-minute video from Microsoft Research: “Spectral graph sparsification Part 2: [An O(mlog^2 n) algorithm for solving SDD systems]”.
Video by Microsoft Research, played through YouTube's embedded player.