Generating connected acyclic digraphs uniformly at random (Q2390252)

From MaRDI portal
Revision as of 20:01, 1 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Generating connected acyclic digraphs uniformly at random
scientific article

    Statements

    title
    Generating connected acyclic digraphs uniformly at random (English)
    0 references
    author
    Guy Melançon
    0 references
    Fabrice Philippe
    0 references
    publication date
    21 July 2009
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C20
    0 references
    05C80
    0 references
    05C85
    0 references
    zbMATH DE Number
    5581129
    0 references
    zbMATH Keywords
    graph algorithms
    0 references
    random generation
    0 references
    simply connected acyclic directed graphs
    0 references
    OpenAlex ID
    W1963516735
    0 references
    arXiv ID
    cs/0403040
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2390252&oldid=35119097"
    Powered by MediaWiki