Bayesian networks: the minimal triangulations of a graph

DOI10.1016/j.tcs.2019.05.030zbMath1434.68367OpenAlexW2955788744MaRDI QIDQ2330088

Truong Thi Thuy Duong, Do Le Paul Minh

Publication date: 18 October 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.05.030

zbMATH Keywords

Bayesian networksminimal triangulationjunction tree algorithmCompMLSM

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Bayesian networks: regenerative Gibbs samplings

Cites Work

• Unnamed Item
• A note on lexicographic breadth first search for chordal graphs
• Enumeration of the perfect sequences of a chordal graph
• On rigid circuit graphs
• Some aspects of perfect elimination orderings in chordal graphs
• Minimal triangulations of graphs: a survey
• An algorithm for testing chordality of graphs
• Maximum cardinality search for computing minimal triangulations of graphs
• Generating and characterizing the perfect elimination orderings of a chordal graph
• Incidence matrices and interval graphs
• Triangulated graphs and the elimination process
• On the Desirability of Acyclic Database Schemes
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• A Unified View of Graph Searching
• Computing the Minimum Fill-In is NP-Complete
• Algorithmic Aspects of Vertex Elimination on Graphs
• Topics in Intersection Graph Theory
• Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings