Pages that link to "Item:Q2545884"
From MaRDI portal
The following pages link to Triangulated graphs and the elimination process (Q2545884):
Displaying 50 items.
- Heuristics for the network design problem with connectivity requirements (Q281782) (← links)
- A generalization of chordal graphs and the maximum clique problem (Q287036) (← links)
- Chordal editing is fixed-parameter tractable (Q300460) (← links)
- A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models (Q415616) (← links)
- Characterizing and computing the structure of clique intersections in strongly chordal graphs (Q479046) (← links)
- Learning discrete decomposable graphical models via constraint optimization (Q517387) (← links)
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (Q621748) (← links)
- Decision making with multiple objectives using GAI networks (Q646528) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637) (← links)
- Treewidth and minimum fill-in on permutation graphs in linear time (Q708222) (← links)
- Extending cycles in graphs (Q750461) (← links)
- Perspectives on the theory and practice of belief functions (Q751097) (← links)
- Domination, independent domination, and duality in strongly chordal graphs (Q788002) (← links)
- Some aspects of perfect elimination orderings in chordal graphs (Q792351) (← links)
- Positive definite completions of partial Hermitian matrices (Q798738) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- On the structure of contractible edges in \(k\)-connected partial \(k\)-trees (Q844219) (← links)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
- Variations of \(Y\)-dominating functions on graphs (Q941347) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- A characterization of signed graphs with generalized perfect elimination orderings (Q965961) (← links)
- Signed and minus clique-transversal functions on graphs (Q976135) (← links)
- On the complexity of signed and minus total domination in graphs (Q990954) (← links)
- Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming (Q999796) (← links)
- Characterizations of strongly chordal graphs (Q1051004) (← links)
- On powers and centers of chordal graphs (Q1055453) (← links)
- Decomposition by clique separators (Q1062072) (← links)
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey (Q1062758) (← links)
- The complexity of generalized clique packing (Q1073049) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- Positive semidefinite matrices with a given sparsity pattern (Q1109100) (← links)
- Maximal chordal subgraphs (Q1115455) (← links)
- Linear time algorithms for NP-hard problems restricted to partial k- trees (Q1116705) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- A simple algorithm for finding a cycle of length greater than three and without diagonals (Q1147514) (← links)
- On minimal augmentation of a graph to obtain an interval graph (Q1154281) (← links)
- Independent domination in chordal graphs (Q1169487) (← links)
- Inheritance principles for chordal graphs (Q1173947) (← links)
- Some aspects of the semi-perfect elimination (Q1175796) (← links)
- An inertia formula for Hermitian matrices with sparse inverses (Q1183205) (← links)
- A simple linear time algorithm for the domatic partition problem on strongly chordal graphs (Q1195488) (← links)
- An algorithm for fraternal orientation of graphs (Q1197981) (← links)
- Strong elimination ordering of the total graph of a tree (Q1201815) (← links)
- Studies on hypergraphs. I: Hyperforests (Q1209154) (← links)
- An algorithm for testing chordality of graphs (Q1216324) (← links)
- A recognition algorithm for the intersection graphs of directed paths in directed trees (Q1219893) (← links)
