Enumeration of labelled chain graphs and labelled essential directed acyclic graphs

Discrete Mathematics

Volumn 270, Issue 1-3, 2003, Pages 267-278

  Steinsky, Bertran ^a  

^a UNIVERSITY OF SALZBURG   (Austria)

Author keywords

Bayesian network; Enumeration; Labelled chain graph; Labelled directed acyclic graph; Labelled essential graph

Indexed keywords

FUNCTIONS; MARKOV PROCESSES; SET THEORY;

DIGRAPHS;

GRAPH THEORY;

EID: 0042031057     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00838-5     Document Type: Article

References (8)

1. Andersson S.A., Madigan D., Perlman M.D. A characterization of Markov equivalence classes for acyclic digraphs. Ann. Statist. 25(2):1997;502-541.
2. Goulden I.P., Jackson D.M. Combinatorial Enumeration. 1983;Wiley, New York.
3. Harary F., Norman R.Z., Cartwright D. Structural Models: An Introduction to the Theory of Graphs. 1965;Wiley, New York.
4. Harary F., Palmer E.M. Graphical Enumeration. 1973;Academic Press, New York.
5. Robinson R.W. Counting labeled acyclic digraphs. Harary F. New Directions in the Theory of Graphs. 1973;239-279 Academic Press, New York.
6. Robinson R.W. Counting unlabeled acyclic digraphs. Lecture Notes Math. 622:1977;28-43.
7. T. Verma, J. Pearl, An algorithm for deciding if a set of observed independencies has a causal explanation, in: D. Dubois, M.P. Wellman, B. D'Ambrosio, P. Smets (Eds.), Uncertainty in Artificial Intelligence, Proceedings of the Eighth Conference, Morgan Kaufman, San Francisco, 1992, pp. 323-330.
8. Wormald N.C. Counting labelled chordal graphs. Graphs Combin. 1:1985;193-200.