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

数据结构与算法 2009-09-29 v9 数值分析

作者: Daniel A. Spielman , Shang-Hua Teng

在 arXiv 上查看 ↗ PDF ↗

摘要

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

关键词

graph algorithms

引用

@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}
}