Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- 13 June 2004
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableKeywords
Other Versions
This publication has 12 references indexed in Scilit:
- Support-Graph PreconditionersSIAM Journal on Matrix Analysis and Applications, 2006
- Support Theory for PreconditioningSIAM Journal on Matrix Analysis and Applications, 2003
- Fast computation of low rank matrix approximationsPublished by Association for Computing Machinery (ACM) ,2001
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithmsJournal of the ACM, 1999
- Efficient approximate solution of sparse linear systemsComputers & Mathematics with Applications, 1998
- Approximating s-t minimum cuts in Õ(n2) timePublished by Association for Computing Machinery (ACM) ,1996
- A Graph-Theoretic Game and Its Application to the k-Server ProblemSIAM Journal on Computing, 1995
- Random walks in a convex body and an improved volume algorithmRandom Structures & Algorithms, 1993
- The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systemsNumerische Mathematik, 1988
- Generalized Nested DissectionSIAM Journal on Numerical Analysis, 1979