Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems
<|reference_start|>Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems: This paper has been divided into three papers. arXiv:0809.3232, arXiv:0808.4134, arXiv:cs/0607105<|reference_end|>
@article{spielman2003nearly-linear,
    title={Nearly-Linear Time Algorithms for Graph Partitioning, Graph
  Sparsification, and Solving Linear Systems},
    author={Daniel A. Spielman and Shang-Hua Teng},
    journal={arXiv preprint arXiv:cs/0310051},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0310051},
    primaryClass={cs.DS cs.NA}
}