Sampling random spanning trees faster than matrix multiplication (Q4978019)
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: Sampling random spanning trees faster than matrix multiplication |
scientific article; zbMATH DE number 6761851
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sampling random spanning trees faster than matrix multiplication |
scientific article; zbMATH DE number 6761851 |
Statements
Sampling random spanning trees faster than matrix multiplication (English)
0 references
17 August 2017
0 references
approximate Schur complement
0 references
graph sparsification
0 references
random spanning trees
0 references
sampling algorithm
0 references
0.926407754421234
0 references
0.8825739026069641
0 references
0.8549247980117798
0 references
0.8117837309837341
0 references
