Formulas for counting acyclic digraph Markov equivalence classes

[1]  G. Dirac.  On rigid circuit graphs , 1961 .

[2]  J. Moon.  Counting labelled trees , 1970 .

[3]  R. W. Robinson.  Counting unlabeled acyclic digraphs , 1977 .

[4]  Judea Pearl,et al.  Equivalence and Synthesis of Causal Models , 1990, UAI.

[5]  Judea Pearl,et al.  An Algorithm for Deciding if a Set of Observed Independencies Has a Causal Explanation , 1992, UAI.

[6]  B. Peyton,et al.  An Introduction to Chordal Graphs and Clique Trees , 1993 .

[7]  A. George,et al.  Graph theory and sparse matrix computation , 1993 .

[8]  David Maxwell Chickering,et al.  Learning Bayesian networks: The combination of knowledge and statistical data , 1995, Mach. Learn..

[9]  David Maxwell Chickering,et al.  A Transformational Characterization of Equivalent Bayesian Network Structures , 1995, UAI.

[10]  D. Madigan,et al.  A characterization of Markov equivalence classes for acyclic digraphs , 1997 .

[11]  Milan Studený,et al.  A graphical characterization of the largest chain graphs , 1999, Int. J. Approx. Reason..

[12]  Michael D. Perlman,et al.  Enumerating Markov Equivalence Classes of Acyclic Digraph Models , 2001, UAI.

[13]  David Maxwell Chickering,et al.  Learning Equivalence Classes of Bayesian Network Structures , 1996, UAI.

[14]  Michael D. Perlman,et al.  The size distribution for Markov equivalence classes of acyclic digraph models , 2002, Artif. Intell..

[15]  Bertran Steinsky,et al.  Enumeration of labelled chain graphs and labelled essential directed acyclic graphs , 2003, Discret. Math..