scientific article; zbMATH DE number 7552281

DOI10.13137/2464-8728/33308zbMath1492.05057MaRDI QIDQ5087784

Alexandru I. Tomescu, Romeo Rizzi

Publication date: 1 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

samplingdirected acyclic graphcounting recurrence

Mathematics Subject Classification ID

Bayesian inference (62F15) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic enumeration of extensional acyclic digraphs
• Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs
• The asymptotic number of acyclic digraphs. I
• The asymptotic number of acyclic digraphs. II
• A characterization of Markov equivalence classes for acyclic digraphs
• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• Counting extensional acyclic digraphs
• The Number of Full Sets with n Elements
• On Sets and Graphs
• Uniform random generation of large acyclic digraphs

This page was built for publication: