Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs |
scientific article |
Statements
Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (English)
0 references
19 January 2015
0 references
parallel algorithms
0 references
linear systems
0 references
low-stretch spanning trees
0 references
low-stretch subgraphs
0 references
low-diameter decomposition
0 references
0 references
0 references
0.8712419271469116
0 references
0.8526930212974548
0 references
0.827686607837677
0 references
0.824286937713623
0 references
0.8180510401725769
0 references
