Algorithmic Aspects of Vertex Elimination on Graphs

Cited in

(only showing first 100 items - show all)

Chordal networks of polynomial ideals
Constant time enumeration by amortization
A linear time algorithm to list the minimal separators of chordal graphs
On the proper orientation number of chordal graphs
Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs
Characterization and Recognition of Partial 3-Trees
Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph
Learning tractable Bayesian networks in the space of elimination orders
An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time
Efficient solutions of hierarchical systems of linear equations
Recognizing LBFS trees of bipartite graphs
Minimal elimination ordering for graphs of bounded degree
Sparse matrix factor modification in structural reanalysis
Coloring Meyniel graphs in linear time
Simple vertex ordering characterizations for graph search
A Characterisation of the Minimal Triangulations of Permutation Graphs
Matrix completions and chordal graphs
Two optimal strategies for active learning of causal models from interventional data
Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
Treewidth and minimum fill-in on permutation graphs in linear time
A survey of direct methods for sparse linear systems
Bayesian graph selection consistency under model misspecification
I/O-efficient algorithms for graphs of bounded treewidth
A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
Chordal graph recognition is in NC
Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime
Bayesian networks: the minimal triangulations of a graph
scientific article; zbMATH DE number 7559375 (Why is no real title available?)
On domination elimination orderings and domination graphs
Exact algorithms for restricted subset feedback vertex set in chordal and split graphs
Graphs with a unique maximum independent set up to automorphisms
The maximum clique problem
On end-vertices of lexicographic breadth first searches
Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs
Kempe changes in degenerate graphs
Heuristic and metaheuristic methods for computing graph treewidth
Organizing the atoms of the clique separator decomposition into an atom tree
A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs
Tree decomposition and discrete optimization problems: a survey
Computing the Minimum Fill-In is NP-Complete
Bisimplicial separators
Minimal vertex separators of chordal graphs
Fast Constrained Image Segmentation Using Optimal Spanning Trees
Commuting projections on graphs
Extending the MAX algorithm for maximum independent set
Parallel \textit{QR} factorization of block-tridiagonal matrices
Labeling algorithms for domination problems in sun-free chordal graphs
Linear-time algorithms for tree root problems
A new algorithm for decomposition of graphical models
On the parameterized complexity of interval scheduling with eligible machine sets
An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
Some aspects of the semi-perfect elimination
Lexicographic orientation algorithms
Chordal graphs and their clique graphs
Independent domination in chordal graphs
Minimal proper interval completions
Minimal split completions
On a property of minimal triangulations
The parallel complexity of elimination ordering procedures
Treewidth versus clique number. II: Tree-independence number
Dismantlability of weakly systolic complexes and applications
Recognizing threshold tolerance graphs in \(O(n^2)\) time
A general label search to investigate classical graph search algorithms
Sparse linear problems and the least squares method
Linear separation of connected dominating sets in graphs
Inheritance principles for chordal graphs
Cycle-free partial orders and chordal comparability graphs
Representing triangulated graphs in stars
Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
Enumeration of the perfect sequences of a chordal graph
Finding large holes
On listing, sampling, and counting the chordal graphs with edge constraints
On minimal augmentation of a graph to obtain an interval graph
Recognition and isomorphism of proper \(H \)-graphs for unicyclic \(H\) in \textit{FPT}-time
A Separator Theorem for Chordal Graphs
Linear time algorithms for dominating pairs in asteroidal triple-free graphs
On claw-free asteroidal triple-free graphs
Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtées
Linear optimization over homogeneous matrix cones
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
Diameter determination on restricted graph families
Recognition of linear and star variants of leaf powers is in P
On treewidth and minimum fill-in of asteroidal triple-free graphs
On the power of graph searching for cocomparability graphs
Generating and characterizing the perfect elimination orderings of a chordal graph
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
The clique minimal separator decomposition of a hypergraph
Extendable shellability for \(d\)-dimensional complexes on \(d+3\) vertices
Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs
Searching for better fill-in
Exploiting special structure in semidefinite programming: a survey of theory and applications
Decomposition by clique separators
The induced path function, monotonicity and betweenness
An \(\mathcal {O}(n^2)\) time algorithm for the minimal permutation completion problem
An \(O(nm)\)-time certifying algorithm for recognizing HHD-free 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)