scientific article; zbMATH DE number 3420184
From MaRDI portal
zbMath0266.65028MaRDI QIDQ5683627
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Minimal triangulations of graphs: a survey, A vertex incremental approach for maintaining chordality, Linear-Time Generation of Random Chordal Graphs, A faster algorithm to recognize undirected path graphs, Characterization of partial 3-trees in terms of three structures, The recognition of geodetically connected graphs, Can transitive orientation make sandwich problems easier?, Chordal editing is fixed-parameter tractable, Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree, Weighted graph based ordering techniques for preconditioned conjugate gradient methods, New linear time algorithms for generating perfect elimination orderings of chordal graphs, The analysis of a nested dissection algorithm, Decomposition in multidimensional Boolean-optimization problems with sparse matrices, Additive approximation for edge-deletion problems, Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs, Unnamed Item, Maximal chordal subgraphs, Two edge modification problems without polynomial kernels, Solution of sparse positive definite systems on a hypercube, Graph Coloring Using Eigenvalue Decomposition, A parallel multifrontal algorithm and its implementation, Efficient algorithms for solving systems of linear equations and path problems, Approximation and Kernelization for Chordal Vertex Deletion, Dichotomy Results on the Hardness of $H$-free Edge Modification Problems, An automatic scaling procedure for a D'yakonov-Gunn iteration scheme, Space-efficient algorithms for reachability in directed geometric graphs, Large Induced Subgraphs via Triangulations and CMSO, Wheel-Free Deletion Is W[2-Hard], Characterizing and Computing Minimal Cograph Completions, Distance descending ordering method: an \(O(n)\) algorithm for inverting the mass matrix in simulation of macromolecules with long branches, On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints, Unnamed Item, A fast algorithm for solving systems of linear equations with two variables per equation, Algorithms and complexity of sandwich problems in graphs (extended abstract), On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems, É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, Searching for better fill-in, State-of-the-Art Sparse Direct Solvers, Sparsity preserving preconditioners for linear systems in interior-point methods, Tree decomposition and discrete optimization problems: a survey, Minimum fill-in of sparse graphs: kernelization and approximation, Partitioning, tearing and modification of sparse linear systems, 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 Separator Theorem for Chordal Graphs, Complexity classification of some edge modification problems, NP-completeness results for edge modification problems, The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation, A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs, Faster and enhanced inclusion-minimal cograph completion, An improved derandomized approximation algorithm for the max-controlled set problem, Minimal triangulation of a graph and optimal pivoting order in a sparse matrix, Improvements to variable elimination and symbolic probabilistic inference for evaluating influence diagrams, Subexponential parameterized algorithms and kernelization on almost chordal graphs, Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions, Numerical analysis of blood flow in the heart, Learning chordal extensions, Counting clique trees and computing perfect elimination schemes in parallel, Minimum fill-in: inapproximability and almost tight lower bounds, Unnamed Item, Heuristic and metaheuristic methods for computing graph treewidth, Avoidable vertices and edges in graphs: existence, characterization, and applications, Minimal vertex separators of chordal graphs, Hardness of edge-modification problems, Two Edge Modification Problems without Polynomial Kernels, Bandwidth and pebbling, On simple characterizations of k-trees, A physical interpretation of factorization and factor modification in structural analysis, Matrix Reordering Using Multilevel Graph Coarsening for ILU Preconditioning, Some aspects of perfect elimination orderings in chordal graphs, A practical algorithm for making filled graphs minimal, Unnamed Item, Decomposition by clique separators, A mathematical model and numerical method for studying platelet adhesion and aggregation during blood clotting, Predicting the structure of sparse orthogonal factors, Compositional models in valuation-based systems, Computing the Minimum Fill-In is NP-Complete
