Daniel A. Spielman, Nikhil Srivastava. Graph sparsification by effective resistances. In Richard E. Ladner, Cynthia Dwork, editors, Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008. pages 563-568, ACM, 2008. [doi]
Abstract is missing.