Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
From MaRDI portal
(Redirected from Publication:1243572)
Cites work
- A Characterization of Comparability Graphs and of Interval Graphs
- scientific article; zbMATH DE number 3322854 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- scientific article; zbMATH DE number 3420184 (Why is no real title available?)
- On rigid circuit graphs
- Representation of a finite graph by a set of intervals on the real line
- The inverse M-matrix problem
- The Use of Linear Graphs in Gauss Elimination
- Triangulated graphs and the elimination process
Cited in
(31)- Decomposition by clique separators
- On minimal augmentation of a graph to obtain an interval graph
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
- Separability generalizes Dirac's theorem
- A practical algorithm for making filled graphs minimal
- Graph extremities defined by search algorithms
- Efficiently enumerating minimal triangulations
- Avoidable vertices and edges in graphs: existence, characterization, and applications
- Minimum fill-in of sparse graphs: kernelization and approximation
- Optimal decomposition by clique separators
- All roads lead to Rome -- new search methods for the optimal triangulation problem
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
- Searching for better fill-in
- Standard imsets for undirected and chain graphical models
- Algorithms for convex hull finding in undirected graphical models
- Extremities and orderings defined by generalized graph search algorithms
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
- Bounds for cell entries in contingency tables given marginal totals and decomposable graphs
- On the minimum chordal completion polytope
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
- scientific article; zbMATH DE number 7053390 (Why is no real title available?)
- Shifting paths to avoidable ones
- Computing and listing avoidable vertices and paths
- Computing and listing avoidable vertices and paths
- Graphs with at most two moplexes
- Marginal Markov subgraph of Bayesian network and its applications
- Growing trees and amoebas' replications
- Avoidability beyond paths
- Minimal triangulations of graphs: a survey
- A note on minimal d-separation trees for structural learning
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs
This page was built for publication: Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1243572)
