Triangulated graphs and the elimination process

Cites Work

Incidence matrices and interval graphs
On rigid circuit graphs
Title not available (Why is that?)
The Use of Linear Graphs in Gauss Elimination
Title not available (Why is that?)

Cited In (only showing first 100 items - show all)

Representation characterizations of chordal bipartite graphs
Decision making with multiple objectives using GAI networks
Probability propagation
Treewidth and minimum fill-in on permutation graphs in linear time
The maximum clique problem
Organizing the atoms of the clique separator decomposition into an atom tree
Weighted maximum-clique transversal sets of graphs
Characterizing and computing the structure of clique intersections in strongly chordal graphs
Independent domination in chordal graphs
Some aspects of the semi-perfect elimination
A remark on perfect Gaussian elimination of symmetric matrices
A Separator Theorem for Chordal Graphs
Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
A characterization of normal fraternally orientable perfect graphs
On minimal augmentation of a graph to obtain an interval graph
Extending cycles in graphs
A sufficiently fast algorithm for finding close to optimal clique trees
Heuristics for the network design problem with connectivity requirements
Subclasses of \(k\)-trees: characterization and recognition
On treewidth and minimum fill-in of asteroidal triple-free graphs
Fitting very large sparse Gaussian graphical models
Digraph measures: Kelly decompositions, games, and orderings
Chordal digraphs
Decomposition by clique separators
Positive definite completions of partial Hermitian matrices
A generalization of chordal graphs and the maximum clique problem
A cop-winning strategy on strongly cop-win graphs
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
Intersection graphs of concatenable subtrees of graphs
Linear time algorithms for NP-hard problems restricted to partial k- trees
Chordal editing is fixed-parameter tractable
Triangulating graphs without asteroidal triples
Reversible jump MCMC for nonparametric drift estimation for diffusion processes
Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
Matrices with chordal inverse zero-patterns
An introduction to clique minimal separator decomposition
Graph extremities defined by search algorithms
Characterizations of strongly chordal graphs
Bipartite permutation graphs
Domination, independent domination, and duality in strongly chordal graphs
Revisiting decomposition by clique separators
On powers and centers of chordal graphs
A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
The complexity of generalized clique packing
The complexity of generalized clique covering
Maximal chordal subgraphs
The forbidden subgraph characterization of directed vertex graphs
A recognition algorithm for the intersection graphs of directed paths in directed trees
Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
Comparability graphs and a new matroid
Treewidth computations. I: Upper bounds
Some aspects of perfect elimination orderings in chordal graphs
Perspectives on the theory and practice of belief functions
Variations of maximum-clique transversal sets on graphs
Triangulating multitolerance graphs
Listing all potential maximal cliques of a graph
Domain permutation reduction for constraint satisfaction problems
Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
Positive semidefinite matrices with a given sparsity pattern
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
An algorithm for fraternal orientation of graphs
Vertex ordering characterizations of graphs of bounded asteroidal number
Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs
A sufficient condition to extend polynomial results for the maximum independent set problem
The intersection graphs of subtrees in trees are exactly the chordal graphs
Minimal separators in \(P_4\)-sparse graphs
Intersection graphs of Helly families of subtrees
All-pairs-shortest-length on strongly chordal graphs
Optimal decomposition by clique separators
Algorithms on clique separable graphs
An inertia formula for Hermitian matrices with sparse inverses
A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
Algorithmic aspects of intersection graphs and representation hypergraphs
Strongly chordal and chordal bipartite graphs are sandwich monotone
On the structure of contractible vertex pairs in chordal graphs
Convexity in Graphs and Hypergraphs
Complexity of Finding Embeddings in a k-Tree
Expansions of Chromatic Polynomials and Log-Concavity
Counting clique trees and computing perfect elimination schemes in parallel
Exploiting chordal structure in polynomial ideals: a Gröbner bases approach
Prim-based support-graph preconditioners for min-cost flow problems
Optimal labelling of unit interval graphs
Learning discrete decomposable graphical models via constraint optimization
Recognition of some perfectly orderable graph classes
Two strikes against perfect phylogeny
A faster algorithm to recognize undirected path graphs
Characterization and Recognition of Partial 3-Trees
Minimal elimination ordering for graphs of bounded degree
Vector representations of graphs and distinguishing quantum product states with one-way LOCC
Decomposition methods for sparse matrix nearness problems
Two optimal strategies for active learning of causal models from interventional data
Matrix completions and chordal graphs
Theory of evidence ? A survey of its mathematical foundations, applications and computational aspects
A characterization of signed graphs with generalized perfect elimination orderings
Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph
Bayesian networks: the minimal triangulations of a graph
Heuristic and metaheuristic methods for computing graph treewidth

This page was built for publication: Triangulated graphs and the elimination process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2545884)