Analysis of Markov chain algorithms on spanning trees, rooted forests, and connected subgraphs (Q5469348)
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: Analysis of Markov chain algorithms on spanning trees, rooted forests, and connected subgraphs |
scientific article; zbMATH DE number 5024325
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of Markov chain algorithms on spanning trees, rooted forests, and connected subgraphs |
scientific article; zbMATH DE number 5024325 |
Statements
Analysis of Markov chain algorithms on spanning trees, rooted forests, and connected subgraphs (English)
0 references
18 May 2006
0 references
spanning trees
0 references
randomized algorithm
0 references
multicommodity flow
0 references
canonical paths
0 references
Markov chain
0 references
rooted forests
0 references
connected subgraphs
0 references
0.8297940492630005
0 references
0.8215341567993164
0 references
0.8071837425231934
0 references
