An almost-linear time algorithm for uniform random spanning tree generation (Q5230291)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7096998
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An almost-linear time algorithm for uniform random spanning tree generation |
scientific article; zbMATH DE number 7096998 |
Statements
An almost-linear time algorithm for uniform random spanning tree generation (English)
0 references
22 August 2019
0 references
Schur complements
0 references
random spanning trees
0 references
random walks
0 references
0.8654628992080688
0 references
0.8549247980117798
0 references
0.854393482208252
0 references
0.8404805064201355
0 references
