Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems, in: (2004)

by D A Spielman, S H Teng
Venue:Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, STOC ’04,