Analysis of Markov chain algorithms on spanning trees, rooted forests, and connected subgraphs (Q5469348): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.4064/am32-3-7 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4064/am32-3-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078547605 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4064/AM32-3-7 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:03, 30 December 2024

scientific article; zbMATH DE number 5024325
Language Label Description Also known as
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references