An extended depth-first search algorithm for optimal triangulation of Bayesian networks
DOI10.1016/j.ijar.2016.09.012zbMath1400.68220OpenAlexW2529734256MaRDI QIDQ2374531
Publication date: 15 December 2016
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2016.09.012
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Safe reduction rules for weighted treewidth
- A note on the problem of reporting maximal cliques
- Understanding the scalability of Bayesian network inference using clique tree growth curves
- On the maximum number of cliques in a graph
- Anytime anyspace probabilistic inference
- Algorithmic graph theory and perfect graphs
- Lazy propagation: A junction tree inference algorithm based on lazy evaluation
- All roads lead to Rome -- new search methods for the optimal triangulation problem
- The computational complexity of probabilistic inference using Bayesian belief networks
- On the hardness of approximate reasoning
- On exact algorithms for treewidth
- Bayesian Networks and Decision Graphs
- Modeling and Reasoning with Bayesian Networks
- Weighted Treewidth Algorithmic Techniques and Results
- A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
This page was built for publication: An extended depth-first search algorithm for optimal triangulation of Bayesian networks
