Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems

Daniel A. Spielman; Shang-Hua Teng

Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems

Data Structures and Algorithms 2009-09-29 v9 Numerical Analysis

Authors: Daniel A. Spielman , Shang-Hua Teng

View on arXiv ↗ PDF ↗

Abstract

This paper has been divided into three papers. arXiv:0809.3232, arXiv:0808.4134, arXiv:cs/0607105

Keywords

graph algorithms

Cite

@article{arxiv.cs/0310051,
  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   = {2009}
}