Bayesian networks: the minimal triangulations of a graph
From MaRDI portal
Publication:2330088
DOI10.1016/J.TCS.2019.05.030zbMATH Open1434.68367OpenAlexW2955788744MaRDI QIDQ2330088FDOQ2330088
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
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
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Topics in Intersection Graph Theory
- Incidence matrices and interval graphs
- On rigid circuit graphs
- Title not available (Why is that?)
- Triangulated graphs and the elimination process
- Minimal triangulations of graphs: a survey
- 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
- Algorithmic Aspects of Vertex Elimination on Graphs
- Computing the Minimum Fill-In is NP-Complete
- Maximum cardinality search for computing minimal triangulations of graphs
- A Unified View of Graph Searching
- Enumeration of the perfect sequences of a chordal graph
- Generating and characterizing the perfect elimination orderings of a chordal graph
- Maximal label search algorithms to compute perfect and minimal elimination orderings
- Some aspects of perfect elimination orderings in chordal graphs
- A note on lexicographic breadth first search for chordal graphs
- An algorithm for testing chordality of graphs
Cited In (11)
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
- Title not available (Why is that?)
- Thinning a Triangulation of a Bayesian Network or Undirected Graph to Create a Minimal Triangulation
- 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
- Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
- Title not available (Why is that?)
- Analysis of Markov boundary induction in Bayesian networks: a new view from matroid theory
- Bayesian networks: regenerative Gibbs samplings
- Triangulation of Bayesian networks by retriangulation
- An evolutionary algorithm for Bayesian network triangulation
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)
