Counting Background Knowledge Consistent Markov Equivalent Directed Acyclic Graphs

摘要

We study the problem of counting the number of directed acyclic graphs in a Markov equivalence class (MEC) that are consistent with