Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs

DOI10.1007/S00373-004-0569-9zbMath1055.05081OpenAlexW2039891646MaRDI QIDQ704838

Bertran Steinsky

Publication date: 20 January 2005

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-004-0569-9

zbMATH Keywords

Bayesian networkAsymptotic enumerationChain graphLabelled essential directed acyclic graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Asymptotic enumeration (05A16) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Asymptotic enumeration of extensional acyclic digraphs ⋮ Counting extensional acyclic digraphs ⋮ Unnamed Item ⋮ Uniform random generation of large acyclic digraphs ⋮ Asymptotic enumeration of compacted binary trees of bounded right height ⋮ A review of Gaussian Markov models for conditional independence

This page was built for publication: Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs