Counting Perfect Matchings and the Switch Chain (Q5232145)

From MaRDI portal
Revision as of 13:05, 30 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127566627, #quickstatements; #temporary_batch_1722291251637)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7099868
Language Label Description Also known as
English
Counting Perfect Matchings and the Switch Chain
scientific article; zbMATH DE number 7099868

    Statements

    title
    Counting Perfect Matchings and the Switch Chain (English)
    0 references
    author
    Martin Dyer
    0 references
    Haiko Müller
    0 references
    publication date
    29 August 2019
    0 references
    zbMATH Keywords
    hereditary graph classes
    0 references
    matchings
    0 references
    approximate counting
    0 references
    Markov chains
    0 references
    cites work
    Quasimonotone graphs
    0 references
    Q4697457
    0 references
    Q3048571
    0 references

    Identifiers

    DOI
    10.1137/18M1172910
    0 references
    Mathematics Subject Classification ID
    05C30
    0 references
    05C70
    0 references
    60J10
    0 references
    62G09
    0 references
    zbMATH DE Number
    7099868
    0 references
    arXiv ID
    1705.05790
    0 references
    OpenAlex ID
    W2963972320
    0 references
    Wikidata QID
    Q127566627
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5232145&oldid=37445080"
    Powered by MediaWiki