scientific article; zbMATH DE number 3420184
From MaRDI portal
Publication:5683627
Cited in
(83)- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
- Hardness of edge-modification problems
- Decomposition by clique separators
- Characterization of partial 3-trees in terms of three structures
- The analysis of a nested dissection algorithm
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
- Maximal chordal subgraphs
- Solution of sparse positive definite systems on a hypercube
- An automatic scaling procedure for a D'yakonov-Gunn iteration scheme
- A fast algorithm for solving systems of linear equations with two variables per equation
- Partitioning, tearing and modification of sparse linear systems
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
- Numerical analysis of blood flow in the heart
- Counting clique trees and computing perfect elimination schemes in parallel
- Minimal vertex separators of chordal graphs
- Predicting the structure of sparse orthogonal factors
- New linear time algorithms for generating perfect elimination orderings of chordal graphs
- A parallel multifrontal algorithm and its implementation
- A practical algorithm for making filled graphs minimal
- Decomposition in multidimensional Boolean-optimization problems with sparse matrices
- Two edge modification problems without polynomial kernels
- Distance descending ordering method: an \(O(n)\) algorithm for inverting the mass matrix in simulation of macromolecules with long branches
- Bandwidth and pebbling
- On simple characterizations of k-trees
- Weighted graph based ordering techniques for preconditioned conjugate gradient methods
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
- Subexponential parameterized algorithms and kernelization on almost chordal graphs
- Learning chordal extensions
- Avoidable vertices and edges in graphs: existence, characterization, and applications
- Minimum fill-in of sparse graphs: kernelization and approximation
- Minimum fill-in: inapproximability and almost tight lower bounds
- Compositional models in valuation-based systems
- A faster algorithm to recognize undirected path graphs
- Can transitive orientation make sandwich problems easier?
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
- Additive approximation for edge-deletion problems
- Searching for better fill-in
- Tree decomposition and discrete optimization problems: a survey
- NP-completeness results for edge modification problems
- The recognition of geodetically connected graphs
- Large Induced Subgraphs via Triangulations and CMSO
- Chordal editing is fixed-parameter tractable
- Rank of tensors of -out-of-k functions: an application in probabilistic inference
- Graph Coloring Using Eigenvalue Decomposition
- State-of-the-art sparse direct solvers
- A Separator Theorem for Chordal Graphs
- Wheel-Free Deletion Is W[2]-Hard
- Characterizing and Computing Minimal Cograph Completions
- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
- Two edge modification problems without polynomial kernels
- É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
- The General Minimum Fill-In Problem
- Computing the Minimum Fill-In is NP-Complete
- Approximation and kernelization for chordal vertex deletion
- Sparsity preserving preconditioners for linear systems in interior-point methods
- Efficient algorithms for solving systems of linear equations and path problems
- On the minimum chordal completion polytope
- An improved derandomized approximation algorithm for the max-controlled set problem
- Matrix reordering using multilevel graph coarsening for ILU preconditioning
- Linear-time generation of random chordal graphs
- Dichotomy results on the hardness of H-free edge modification problems
- Heuristic and metaheuristic methods for computing graph treewidth
- scientific article; zbMATH DE number 7053390 (Why is no real title available?)
- scientific article; zbMATH DE number 7651188 (Why is no real title available?)
- Complexity classification of some edge modification problems
- Improvements to variable elimination and symbolic probabilistic inference for evaluating influence diagrams
- Space-efficient algorithms for reachability in directed geometric graphs
- Algorithms and complexity of sandwich problems in graphs (extended abstract)
- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
- Sparse linear least-squares problems
- Tight bounds for chordal/interval vertex deletion parameterized by treewidth
- Efficient diagonalization of symmetric matrices associated with graphs of small treewidth
- Cayley trees and increasing 1, 2-trees: let's twist!
- A physical interpretation of factorization and factor modification in structural analysis
- Some aspects of perfect elimination orderings in chordal graphs
- A mathematical model and numerical method for studying platelet adhesion and aggregation during blood clotting
- Minimal triangulations of graphs: a survey
- A vertex incremental approach for maintaining chordality
- Characterizing and computing minimal cograph completions
- On listing, sampling, and counting the chordal graphs with edge constraints
- Near-optimal solutions for the generalized max-controlled set problem
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5683627)