Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems (Q3580949)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems |
scientific article |
Statements
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems (English)
0 references
15 August 2010
0 references
