Sampling \(k\)-partite graphs with a given degree sequence (Q2326166)

From MaRDI portal
Revision as of 14:22, 10 October 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128631787, #quickstatements; #temporary_batch_1728564459526)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Sampling \(k\)-partite graphs with a given degree sequence
scientific article

    Statements

    title
    Sampling \(k\)-partite graphs with a given degree sequence (English)
    0 references
    author
    Yanyan Li
    0 references
    publication date
    7 October 2019
    0 references
    zbMATH Keywords
    degree sequence
    0 references
    contraction of a degree sequence
    0 references
    degree sequence bipartition
    0 references
    contraction of a graph
    0 references
    deletion of a graph
    0 references
    ecological occurrence matrix
    0 references

    Identifiers

    zbMATH DE Number
    7113833
    0 references
    OpenAlex ID
    W2909715706
    0 references
    Wikidata QID
    Q128631787
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2326166&oldid=37855687"
    Powered by MediaWiki