Look Who it Was Random video

Archive: Spectral Sparsification of Graphs

2,593 views · Published 3 June 2014 · 58:29 · Indexed 8 November 2026

Channel: UW Video · 2014 · Education

Watch on YouTube

Dr. Dan Spielman presents an efficient, randomized algorithm for constructing sparse approximations that only uses a logarithmic factor more edges than optimal. The algorithms follow from the solution of a problem in linear algebra. Dr. Spellman is a Professor of Computer Science, Mathematics and Applied Mathematics at Yale University and Co-Director of the Yale Institute for Network Science.

Dr. Dan Spielman, Professor of Computer Science, Mathematics and Applied Mathematics and Co-Director of the Yale Institute for Network Science

5/8/2014

http://www.cs.washington.edu/
The University of Washington is committed to ensuring digital accessibility in our services, programs, and activities. If you encounter accessibility barriers using videos found on this channel, please contact UW Video at uwvideo [at] uw [dot] edu.

More from this channel