Random generation of essential directed acyclic graphs
From MaRDI portal
Publication:5087784
DOI10.13137/2464-8728/33308zbMATH Open1492.05057MaRDI QIDQ5087784FDOQ5087784
Authors: Romeo Rizzi, Alexandru I. Tomescu 
Publication date: 1 July 2022
Recommendations
Bayesian inference (62F15) Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)
Cites Work
- A characterization of Markov equivalence classes for acyclic digraphs
- Title not available (Why is that?)
- Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
- The asymptotic number of acyclic digraphs. I
- The asymptotic number of acyclic digraphs. II
- Counting extensional acyclic digraphs
- Asymptotic enumeration of extensional acyclic digraphs
- The Number of Full Sets with n Elements
- Title not available (Why is that?)
- Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs
- Title not available (Why is that?)
- On sets and graphs. Perspectives on logic and combinatorics
- Uniform random generation of large acyclic digraphs
Cited In (10)
- Asymptotic behaviour of essential graphs
- Random Generation of Directed Acyclic Graphs
- Uniform random generation of large acyclic digraphs
- Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets
- Efficient coding of labeled directed acyclic graphs
- Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
- A Family of Tree-Based Generators for Bubbles in Directed Graphs
- Title not available (Why is that?)
- Some results about essential graphs
- Generating connected acyclic digraphs uniformly at random
This page was built for publication: Random generation of essential directed acyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087784)
