Algorithmic Aspects of Vertex Elimination on Graphs

DOI10.1137/0205021zbMATH Open0353.65019DBLPjournals/siamcomp/RoseTL76OpenAlexW2086119402WikidataQ56016677 ScholiaQ56016677MaRDI QIDQ4124209FDOQ4124209

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

Minimal elimination ordering for graphs of bounded degree
A linear time algorithm to list the minimal separators of chordal graphs
On the proper orientation number of chordal graphs
An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time
A survey of direct methods for sparse linear systems
I/O-efficient algorithms for graphs of bounded treewidth
A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
Heuristic and metaheuristic methods for computing graph treewidth
Chordal graph recognition is in NC
Chordal graphs and their clique graphs
Minimal vertex separators of chordal graphs
Linear-time algorithms for tree root problems
A new algorithm for decomposition of graphical models
An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
Representing triangulated graphs in stars
Recognition of linear and star variants of leaf powers is in P
An \(\mathcal {O}(n^2)\) time algorithm for the minimal permutation completion problem
An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs
The isomorphism problem for \(k\)-trees is complete for logspace
Finding houses and holes in graphs
Cuts, matrix completions and graph rigidity
Triangulated neighborhoods in even-hole-free graphs
Burning two worlds
The solution space of sorting with recurring comparison faults
The recognition problem of graph search trees
Maximum induced matching problem on hhd-free graphs
Weak bipolarizable graphs
Probe Ptolemaic Graphs
Title not available (Why is that?)
The General Minimum Fill-In Problem
On linear and circular structure of (claw, net)-free graphs
An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs
Maximal sub-triangulation in pre-processing phylogenetic data
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
On vertex ranking of a starlike graph
Recognizing graphs without asteroidal triples
Robustness to dependency in portfolio optimization using overlapping marginals
Algorithms for unipolar and generalized split graphs
Efficient algorithms for network localization using cores of underlying graphs
Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs
On constructing the elimination tree
Covering, Packing and Generalized Perfection
Classes of perfect graphs
High dimensional posterior convergence rates for decomposable graphical models
A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
Efficient parallel graph algorithms for coarse grained multicomputers and BSP
A polynomial algorithm for the parity path problem on perfectly orientable graphs
MPQ-trees for the orthogonal packing problem
Linear-time generation of random chordal graphs
Estimating the number of connected components in a graph via subgraph sampling
Minimal elimination of planar graphs
Triangulation of Bayesian networks by retriangulation
Convex dominating sets in maximal outerplanar graphs
Recognizing different types of beta-cycles in a database scheme
Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete
Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques
Minimal obstructions for partial representations of interval graphs
Method of fundamental solutions for 3D elasticity with body forces by coupling compactly supported radial basis functions
An implementation of the iterative proportional fitting procedure by propagation trees.
Hybrid backtracking bounded by tree-decomposition of constraint networks
Calculs de complexité relatifs à une méthode de dissection emboîtée
PRM inference using Jaffray \& Faÿ's local conditioning
A note on lexicographic breadth first search for chordal graphs
A Characterisation of the Minimal Triangulations of Permutation Graphs
Treewidth and minimum fill-in on permutation graphs in linear time
On end-vertices of lexicographic breadth first searches
Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs
Organizing the atoms of the clique separator decomposition into an atom tree
Minimal proper interval completions
Minimal split completions
On a property of minimal triangulations
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
A general label search to investigate classical graph search algorithms
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
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
Enumeration of the perfect sequences of a chordal graph
Finding large holes
A vertex incremental approach for maintaining chordality
Minimal fill in O(\(n^{2.69}\)) time
A parallel graph partitioning algorithm for a message-passing multiprocessor
Subclasses of \(k\)-trees: characterization and recognition
Generating and characterizing the perfect elimination orderings of a chordal graph
On treewidth and minimum fill-in of asteroidal triple-free graphs
The induced path function, monotonicity and betweenness
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
On the structure of (\(P_{5}\),\,gem)-free graphs
LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
Retracts of products of chordal graphs
On the classes of interval graphs of limited nesting and count of lengths
Separability generalizes Dirac's theorem
A note on odd/even cycles
A practical algorithm for making filled graphs minimal
An introduction to clique minimal separator decomposition
Graph extremities defined by search algorithms
Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
Maximum independent set and maximum clique algorithms for overlap graphs
Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
Fast minimal triangulation algorithm using minimum degree criterion
Extending partial representations of subclasses of chordal graphs

This page was built for publication: Algorithmic Aspects of Vertex Elimination on Graphs

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