DeepAI AI Chat
Log In Sign Up

Proving the NP-completeness of optimal moral graph triangulation

by   Yang Li, et al.

Moral graphs were introduced in the 1980s as an intermediate step when transforming a Bayesian network to a junction tree, on which exact belief propagation can be efficiently done. The moral graph of a Bayesian network can be trivially obtained by connecting non-adjacent parents for each node in the Bayesian network and dropping the direction of each edge. Perhaps because the moralization process looks simple, there has been little attention on the properties of moral graphs and their impact in belief propagation on Bayesian networks. This paper addresses the mistaken claim that it has been previously proved that optimal moral graph triangulation with the constraints of minimum fill-in, treewidth or total states is NP-complete. The problems are in fact NP-complete, but they have not previously been proved. We now prove these.


page 1

page 2

page 3

page 4


Treewidth is NP-Complete on Cubic Graphs (and related results)

In this paper, we give a very simple proof that Treewidth is NP-complete...

Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs

We show that Edge Multiway Cut (also called Multiterminal Cut) and Node ...

NP-completeness Results for Graph Burning on Geometric Graphs

Graph burning runs on discrete time steps. The aim of the graph burning ...

Palette-colouring: a belief-propagation approach

We consider a variation of the prototype combinatorial-optimisation prob...

Burning Geometric Graphs

A procedure called graph burning was introduced to facilitate the modell...

Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth

Upward planarity testing and Rectilinear planarity testing are central p...

Phase Transition of Tractability in Constraint Satisfaction and Bayesian Network Inference

There has been great interest in identifying tractable subclasses of NP ...