Generating connected acyclic digraphs uniformly at random (Q2390252): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: cs/0403040 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding a Minimum Circuit in a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The asymptotic number of acyclic digraphs. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Counting acyclic digraphs by sources and sinks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the shape of a random acyclic digraph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Random Generation of Directed Acyclic Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5675746 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4154580 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3135094 / rank | |||
Normal rank |
Latest revision as of 20:01, 1 July 2024
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
21 July 2009
0 references
graph algorithms
0 references
random generation
0 references
simply connected acyclic directed graphs
0 references