A sufficiently fast algorithm for finding close to optimal clique trees
From MaRDI portal
Publication:5940778
DOI10.1016/S0004-3702(00)00075-8zbMATH Open0972.68152MaRDI QIDQ5940778FDOQ5940778
Authors: Ann Becker, Dan Geiger 
Publication date: 20 August 2001
Published in: Artificial Intelligence (Search for Journal in Brave)
Recommendations
- An optimal approximation algorithm for Bayesian inference
- scientific article; zbMATH DE number 1003266
- All roads lead to Rome -- new search methods for the optimal triangulation problem
- Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
- The necessity of bounded treewidth for efficient inference in Bayesian networks
Cites Work
- Graph minors. XIII: The disjoint paths problem
- Easy problems for tree-decomposable graphs
- Complexity of Finding Embeddings in a k-Tree
- The Complexity of Multiterminal Cuts
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Title not available (Why is that?)
- A linear time algorithm for finding tree-decompositions of small treewidth
- Treewidth. Computations and approximations
- Triangulated graphs and the elimination process
- Characterization and Recognition of Partial 3-Trees
- Title not available (Why is that?)
- Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
- Tree clustering for constraint networks
- Multiway cuts in directed and node weighted graphs
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Fusion, propagation, and structuring in belief networks
- Title not available (Why is that?)
Cited In (17)
- A matching algorithm in PMWL based on CluTree
- An Efficient Algorithm for Enumerating Pseudo Cliques
- Finding \(k\)-secluded trees faster
- Discovering a junction tree behind a Markov network by a greedy algorithm
- Approximation algorithms for treewidth
- Understanding the scalability of Bayesian network inference using clique tree growth curves
- On the maximum cardinality search lower bound for treewidth
- Decomposition of structural learning about directed acyclic graphs
- Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
- Bayesian network based multiagent system -- application in e-marketplace
- An extended depth-first search algorithm for optimal triangulation of Bayesian networks
- Treewidth computations. I: Upper bounds
- Tree decompositions and social graphs
- Pure Nash equilibria in graphical games and treewidth
- On sparse discretization for graphical games
- Triangulation of Bayesian networks by retriangulation
- Hybrid backtracking bounded by tree-decomposition of constraint networks
This page was built for publication: A sufficiently fast algorithm for finding close to optimal clique trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5940778)
