Minimal triangulation of a graph and optimal pivoting order in a sparse matrix

DOI10.1016/0022-247X(76)90182-7zbMATH Open0371.65006MaRDI QIDQ1243572FDOQ1243572

Authors: Tatsuo Ohtsuki, Lap Kit Cheung, Toshio Fujisawa

Publication date: 1976

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Direct numerical methods for linear systems and matrix inversion (65F05) Graph theory (05C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cites Work

On rigid circuit graphs
Representation of a finite graph by a set of intervals on the real line
Title not available (Why is that?)
A Characterization of Comparability Graphs and of Interval Graphs
Triangulated graphs and the elimination process
Title not available (Why is that?)
Title not available (Why is that?)
The Use of Linear Graphs in Gauss Elimination
The inverse M-matrix problem

Cited In (29)

An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
On minimal augmentation of a graph to obtain an interval graph
Searching for better fill-in
Decomposition by clique separators
Graphs with at most two moplexes
Separability generalizes Dirac's theorem
Minimal triangulations of graphs: a survey
A practical algorithm for making filled graphs minimal
Graph extremities defined by search algorithms
Title not available (Why is that?)
Computing and listing avoidable vertices and paths
Shifting paths to avoidable ones
All roads lead to Rome -- new search methods for the optimal triangulation problem
On the minimum chordal completion polytope
Marginal Markov subgraph of Bayesian network and its applications
Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
Minimum fill-in of sparse graphs: kernelization and approximation
Efficiently enumerating minimal triangulations
Optimal decomposition by clique separators
Avoidable vertices and edges in graphs: existence, characterization, and applications
Standard imsets for undirected and chain graphical models
Computing and listing avoidable vertices and paths
Bounds for cell entries in contingency tables given marginal totals and decomposable graphs
Algorithms for convex hull finding in undirected graphical models
Extremities and orderings defined by generalized graph search algorithms
A note on minimal d-separation trees for structural learning
Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
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)