Bayesian networks: The minimal triangulations of a graph

摘要

Graph triangulation plays an essential role in the study of the Bayesian networks, especially in the celebrated Junction Tree Algorithm. Here we present a simple new proof for CompMLSM by Berry et al. (2009), which generalizes all known algorithms searching for the minimal triangulations of a graph. We also show how CompMLSM may be implemented in our General Minimal Triangulation algorithm. (C) 2019 Elsevier B.V. All rights reserved.