Pages that link to "Item:Q5940778"
From MaRDI portal
The following pages link to A sufficiently fast algorithm for finding close to optimal clique trees (Q5940778):
Displaying 14 items.
- A matching algorithm in PMWL based on CluTree (Q265007) (← links)
- Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (Q442287) (← links)
- Bayesian network based multiagent system -- application in e-marketplace (Q597239) (← links)
- Hybrid backtracking bounded by tree-decomposition of constraint networks (Q814455) (← links)
- Approximation algorithms for treewidth (Q848843) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
- Pure Nash equilibria in graphical games and treewidth (Q2343086) (← links)
- Decomposition of structural learning about directed acyclic graphs (Q2457633) (← links)
- Triangulation of Bayesian networks by retriangulation (Q4419295) (← links)
- On Sparse Discretization for Graphical Games (Q5130000) (← links)
- An Efficient Algorithm for Enumerating Pseudo Cliques (Q5387774) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- Finding \(k\)-secluded trees faster (Q6039423) (← links)