A sufficiently fast algorithm for finding close to optimal clique trees
From MaRDI portal
Publication:5940778
DOI10.1016/S0004-3702(00)00075-8zbMath0972.68152MaRDI QIDQ5940778
Publication date: 20 August 2001
Published in: Artificial Intelligence (Search for Journal in Brave)
Related Items (11)
Approximation algorithms for treewidth ⋮ Bayesian network based multiagent system -- application in e-marketplace ⋮ Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time ⋮ On Sparse Discretization for Graphical Games ⋮ Decomposition of structural learning about directed acyclic graphs ⋮ Treewidth computations. I: Upper bounds ⋮ Triangulation of Bayesian networks by retriangulation ⋮ On the maximum cardinality search lower bound for treewidth ⋮ Tree decompositions and social graphs ⋮ Pure Nash equilibria in graphical games and treewidth ⋮ Hybrid backtracking bounded by tree-decomposition of constraint networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fusion, propagation, and structuring in belief networks
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Tree clustering for constraint networks
- Treewidth. Computations and approximations
- Graph minors. XIII: The disjoint paths problem
- Triangulated graphs and the elimination process
- Easy problems for tree-decomposable graphs
- Characterization and Recognition of Partial 3-Trees
- Complexity of Finding Embeddings in a k-Tree
- The Complexity of Multiterminal Cuts
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Multiway cuts in directed and node weighted graphs
- Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
- A linear time algorithm for finding tree-decompositions of small treewidth
This page was built for publication: A sufficiently fast algorithm for finding close to optimal clique trees
