Generating connected acyclic digraphs uniformly at random (Q2390252)

From MaRDI portal
Revision as of 00:09, 4 August 2023 by Importer (talk | contribs) (‎Created a new 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

    Generating connected acyclic digraphs uniformly at random (English)
    0 references
    0 references
    0 references
    21 July 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    random generation
    0 references
    simply connected acyclic directed graphs
    0 references