No label defined (Q4228482)
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 1256746
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1256746 |
Statements
18 May 1999
0 references
graphic algorithms
0 references
spanning tree
0 references
random trees
0 references
random rooted trees
0 references
0.8646752834320068
0 references
0.8581048250198364
0 references
0.8368141651153564
0 references
0.8335522413253784
0 references
A new algorithm for generating random spanning trees is given that works for both undirected and directed graphs. The algorithm is compared to alternative algorithms presented in previous work and it is shown to be usually much faster. For the entire collection see [Zbl 0908.00030].
0 references
