Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.

DOI10.1016/S0012-365X(02)00838-5zbMath1060.05047MaRDI QIDQ1406560

Bertran Steinsky

Publication date: 4 September 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Bayesian networkEnumerationLabelled chain graphLabelled directed acyclic graphLabelled essential graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (10)

Searching multiregression dynamic models of resting-state fMRI networks using integer programming ⋮ Asymptotic enumeration of extensional acyclic digraphs ⋮ On expressiveness of the chain graph interpretations ⋮ Bayesian detection of event spreading pattern from multivariate binary time series ⋮ Counting extensional acyclic digraphs ⋮ Counting Markov equivalence classes for DAG models on trees ⋮ Formulas for counting acyclic digraph Markov equivalence classes ⋮ Unnamed Item ⋮ Uniform random generation of large acyclic digraphs ⋮ Asymptotic enumeration of compacted binary trees of bounded right height

Cites Work

• Counting labelled chordal graphs
• A characterization of Markov equivalence classes for acyclic digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.