Approximate belief updating in max-2-connected Bayes networks is NP-hard

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


A max-2-connected Bayes network is one where there are at most 2 distinct directed paths between any two nodes. We show that even for this restricted topology, null-evidence belief updating is hard to approximate.

Original languageEnglish
Pages (from-to)1150-1153
Number of pages4
JournalArtificial Intelligence
Issue number12-13
StatePublished - 1 Aug 2009


  • Bayes network
  • Complexity
  • Max-k-connected

ASJC Scopus subject areas

  • Language and Linguistics
  • Linguistics and Language
  • Artificial Intelligence


Dive into the research topics of 'Approximate belief updating in max-2-connected Bayes networks is NP-hard'. Together they form a unique fingerprint.

Cite this