Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
