An efficient algorithm for counting Markov equivalent DAGs

DOI10.1016/j.artint.2021.103648OpenAlexW3216045540MaRDI QIDQ2667829

Robert Ganian, Topi Talvitie, Thekla Hamm

Publication date: 2 March 2022

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2021.103648

zbMATH Keywords

computational complexitychordal graphsMarkov equivalence

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items (2)

Causal structure learning: a combinatorial perspective ⋮ Sound and complete causal identification with latent variables given local background knowledge

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphical methods, inductive causal inference, and econometrics: a literature review
• The clique-separator graph for chordal graphs
• Estimating high-dimensional intervention effects from observational data
• A characterization of Markov equivalence classes for acyclic digraphs
• Counting Markov equivalence classes for DAG models on trees
• A characterisation of rigid circuit graphs
• The size distribution for Markov equivalence classes of acyclic digraph models.
• Generating and characterizing the perfect elimination orderings of a chordal graph
• Incidence matrices and interval graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• An Efficient Method for Generating Discrete Random Variables with General Distributions
• Polynomial-Time Algorithm for the Leafage of Chordal Graphs
• The leafage of a chordal graph
• Graph Classes: A Survey

This page was built for publication: An efficient algorithm for counting Markov equivalent DAGs