Bayesian networks: the minimal triangulations of a graph

DOI10.1016/J.TCS.2019.05.030MaRDI QIDQ2330088zbMATH OpenOpenAlexFDO

Authors Do Le Paul Minh, Truong Thi Thuy Duong

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 networksCompMLSMjunction tree algorithmminimal triangulation

Mathematics Subject Classification ID

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

Recommendations

• Triangulation of Bayesian networks by retriangulation
• Thinning a Triangulation of a Bayesian Network or Undirected Graph to Create a Minimal Triangulation
• Bayesian Networks and Decision Graphs
• scientific article; zbMATH DE number 1634667
• Bayesian Networks
• scientific article; zbMATH DE number 5866255
• Bayesian networks
• Graphs for margins of Bayesian networks
• Bayesian network

Cites work

• A note on lexicographic breadth first search for chordal graphs
• A Unified View of Graph Searching
• Algorithmic Aspects of Vertex Elimination on Graphs
• An algorithm for testing chordality of graphs
• Computing the Minimum Fill-In is NP-Complete
• Enumeration of the perfect sequences of a chordal graph
• Generating and characterizing the perfect elimination orderings of a chordal graph
• scientific article; zbMATH DE number 4121482 (Why is no real title available?)
• Incidence matrices and interval graphs
• Maximal label search algorithms to compute perfect and minimal elimination orderings
• Maximum cardinality search for computing minimal triangulations of graphs
• Minimal triangulations of graphs: a survey
• On rigid circuit graphs
• 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
• Some aspects of perfect elimination orderings in chordal graphs
• Topics in Intersection Graph Theory
• Triangulated graphs and the elimination process

Cited in

(12)

• Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
• An extended depth-first search algorithm for optimal triangulation of Bayesian networks
• All roads lead to Rome -- new search methods for the optimal triangulation problem
• Analysis of Markov boundary induction in Bayesian networks: a new view from matroid theory
• Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
• Triangulation of Bayesian networks by retriangulation
• scientific article; zbMATH DE number 1927376 (Why is no real title available?)
• Thinning a Triangulation of a Bayesian Network or Undirected Graph to Create a Minimal Triangulation
• scientific article; zbMATH DE number 6419207 (Why is no real title available?)
• Bayesian networks: regenerative Gibbs samplings
• An evolutionary algorithm for Bayesian network triangulation
• Bayesian networks: Exact inference via macro-node polytrees

This page was built for publication: Bayesian networks: the minimal triangulations of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2330088)