Pages that link to "Item:Q2545884"
From MaRDI portal
The following pages link to Triangulated graphs and the elimination process (Q2545884):
Displaying 50 items.
- Comparability graphs and a new matroid (Q1235707) (← links)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (Q1242450) (← links)
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix (Q1243572) (← links)
- Algorithms on clique separable graphs (Q1246434) (← links)
- A note on perfect Gaussian elimination (Q1246439) (← links)
- The complexity of generalized clique covering (Q1262127) (← links)
- Counting clique trees and computing perfect elimination schemes in parallel (Q1262131) (← links)
- A remark on perfect Gaussian elimination of symmetric matrices (Q1262880) (← links)
- Minimal vertex separators of chordal graphs (Q1281392) (← links)
- The forbidden subgraph characterization of directed vertex graphs (Q1297413) (← links)
- The maximum clique problem (Q1318271) (← links)
- A parallel algorithm for computing Steiner trees in strongly chordal graphs (Q1329803) (← links)
- The parallel solution of domination problems on chordal and strongly chordal graphs (Q1331893) (← links)
- Intersection graphs of concatenable subtrees of graphs (Q1331898) (← links)
- Invertible completions of partial operator matrices: The nonsymmetric case (Q1336416) (← links)
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) (← links)
- Metric graphs elastically embeddable in the plane (Q1352120) (← links)
- Probability propagation (Q1356197) (← links)
- A characterization of normal fraternally orientable perfect graphs (Q1357743) (← links)
- On treewidth and minimum fill-in of asteroidal triple-free graphs (Q1392207) (← links)
- Triangulating multitolerance graphs (Q1392575) (← links)
- Matrix completions and chordal graphs (Q1412950) (← links)
- Listing all potential maximal cliques of a graph (Q1605302) (← links)
- Reversible jump MCMC for nonparametric drift estimation for diffusion processes (Q1621341) (← links)
- Graph extremities defined by search algorithms (Q1662546) (← links)
- An introduction to clique minimal separator decomposition (Q1662549) (← links)
- Computing a clique tree with the algorithm maximal label search (Q1662609) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- Paired threshold graphs (Q1801073) (← links)
- Recognition of some perfectly orderable graph classes (Q1811119) (← links)
- Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs (Q1842819) (← links)
- Optimal labelling of unit interval graphs (Q1906576) (← links)
- Triangulating graphs without asteroidal triples (Q1917255) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
- Intersection graphs of Helly families of subtrees (Q1917300) (← links)
- All-pairs-shortest-length on strongly chordal graphs (Q1923609) (← links)
- Fitting very large sparse Gaussian graphical models (Q1927038) (← links)
- Chordal digraphs (Q1929220) (← links)
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph (Q1944936) (← links)
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
- Efficiently enumerating minimal triangulations (Q1983135) (← 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)
- Vector representations of graphs and distinguishing quantum product states with one-way LOCC (Q2185850) (← links)
- Chordal graphs in triangular decomposition in top-down style (Q2200301) (← links)
- Exploiting partial correlations in distributionally robust optimization (Q2227536) (← links)
- Electrical networks and hyperplane arrangements (Q2326914) (← links)
- Bayesian networks: the minimal triangulations of a graph (Q2330088) (← links)
- Speeding-up structured probabilistic inference using pattern mining (Q2353925) (← links)
- Optimal decomposition by clique separators (Q2366013) (← links)
