Pages that link to "Item:Q819823"
From MaRDI portal
The following pages link to Minimal triangulations of graphs: a survey (Q819823):
Displaying 50 items.
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- Search-space size in contraction hierarchies (Q306264) (← links)
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090) (← links)
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
- Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (Q442287) (← links)
- The software to analyze the states of complex systems under uncertainty based on fuzzy belief network models (Q466019) (← links)
- Fast minimal triangulation algorithm using minimum degree criterion (Q551209) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Minimal split completions (Q967310) (← links)
- A note on minimal d-separation trees for structural learning (Q969533) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- On the complexity of computing treelength (Q972342) (← links)
- On listing, sampling, and counting the chordal graphs with edge constraints (Q974754) (← links)
- On a property of minimal triangulations (Q1024493) (← links)
- Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- An introduction to clique minimal separator decomposition (Q1662549) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← links)
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem (Q1720313) (← links)
- Efficiently enumerating minimal triangulations (Q1983135) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Exploiting variable sparsity in computing equilibria of biological dynamical systems by triangular decomposition (Q2061992) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- Bayesian graph selection consistency under model misspecification (Q2214264) (← links)
- Bayes linear analysis for ordinary differential equations (Q2242017) (← links)
- Minimum fill-in of sparse graphs: kernelization and approximation (Q2258069) (← links)
- Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network (Q2268854) (← links)
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
- Bayesian networks: the minimal triangulations of a graph (Q2330088) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- Searching for better fill-in (Q2453556) (← links)
- Standard imsets for undirected and chain graphical models (Q2515506) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
- An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem (Q2827805) (← links)
- On the Number of Minimal Separators in Graphs (Q2827806) (← links)
- Simplified numerical form of universal finite type invariant of Gauss words (Q2848020) (← links)
- An integer programming model for the minimum interval graph completion problem (Q2883618) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- An improved lower bound on the minimum number of triangulations (Q3132839) (← links)
- Decomposition Methods for Sparse Matrix Nearness Problems (Q3456880) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints (Q3511357) (← links)
- On the Minimal Density of Triangles in Graphs (Q3527546) (← links)
- (Q4252036) (← links)
