Finding Consensus Bayesian Network Structures
Comments Changes from v3 to v4: Section 1 has been extended with more motivation and a review of the literature. Theorem 3 proves that CONSENSUS is not only NP-hard but NP-complete. A flaw in Theorem 4 has been fixed. The proof of Theorem 5 has been re-written from scratch. Now, it is self-contained, i.e. it does not rely upon the algorithm by Chickering (2004)
Journal ref Journal of Artificial Intelligence Research, 42, 661-687, 2011