Daniel A. Spielman, Shang-Hua Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In László Babai, editor, Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004. pages 81-90, ACM, 2004. [doi]
@inproceedings{SpielmanT04,
title = {Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems},
author = {Daniel A. Spielman and Shang-Hua Teng},
year = {2004},
doi = {10.1145/1007352.1007372},
url = {http://doi.acm.org/10.1145/1007352.1007372},
tags = {graph-rewriting, rewriting, partitioning},
researchr = {https://researchr.org/publication/SpielmanT04},
cites = {0},
citedby = {0},
pages = {81-90},
booktitle = {Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004},
editor = {László Babai},
publisher = {ACM},
isbn = {1-58113-852-0},
}