Pages that link to "Item:Q1243572"
From MaRDI portal
The following pages link to Minimal triangulation of a graph and optimal pivoting order in a sparse matrix (Q1243572):
Displaying 28 items.
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models (Q415616) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A note on minimal d-separation trees for structural learning (Q969533) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Decomposition by clique separators (Q1062072) (← links)
- On minimal augmentation of a graph to obtain an interval graph (Q1154281) (← links)
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) (← links)
- Separability generalizes Dirac's theorem (Q1392561) (← links)
- A practical algorithm for making filled graphs minimal (Q1589427) (← links)
- Graph extremities defined by search algorithms (Q1662546) (← links)
- Efficiently enumerating minimal triangulations (Q1983135) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- Minimum fill-in of sparse graphs: kernelization and approximation (Q2258069) (← links)
- Optimal decomposition by clique separators (Q2366013) (← links)
- All roads lead to Rome -- new search methods for the optimal triangulation problem (Q2375332) (← links)
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
- Searching for better fill-in (Q2453556) (← links)
- Standard imsets for undirected and chain graphical models (Q2515506) (← links)
- Algorithms for convex hull finding in undirected graphical models (Q2698143) (← links)
- Extremities and orderings defined by generalized graph search algorithms (Q3439374) (← links)
- Bounds for cell entries in contingency tables given marginal totals and decomposable graphs (Q4528252) (← links)
- (Q5126619) (← links)
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs (Q5387822) (← links)
- (Q5743514) (← links)
- Shifting paths to avoidable ones (Q6057583) (← links)
- Computing and listing avoidable vertices and paths (Q6185944) (← links)
- Graphs with at most two moplexes (Q6595515) (← links)
- Marginal Markov subgraph of Bayesian network and its applications (Q6631993) (← links)
